./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:55:32,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:55:32,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:55:32,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:55:32,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:55:32,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:55:32,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:55:32,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:55:32,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:55:32,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:55:32,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:55:32,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:55:32,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:55:32,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:55:32,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:55:32,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:55:32,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:55:32,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:55:32,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:55:32,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:55:32,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:55:32,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:55:32,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:55:32,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:55:32,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:55:32,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:55:32,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:55:32,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:55:32,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:55:32,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:55:32,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:55:32,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:55:32,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:55:32,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:55:32,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:55:32,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:55:32,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:55:32,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:55:32,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:55:32,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:55:32,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:55:32,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:55:32,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:55:32,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:55:32,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:55:32,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:55:32,649 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:55:32,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:55:32,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:55:32,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:55:32,651 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:55:32,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:55:32,652 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:55:32,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:55:32,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:55:32,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:55:32,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:55:32,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:55:32,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:55:32,653 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:55:32,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:55:32,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:55:32,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:55:32,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:55:32,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:55:32,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:55:32,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:55:32,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:55:32,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:55:32,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:55:32,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:55:32,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:55:32,656 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:55:32,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:55:32,657 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:55:32,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:55:32,657 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/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_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 [2022-11-25 16:55:33,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:55:33,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:55:33,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:55:33,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:55:33,063 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:55:33,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2022-11-25 16:55:36,034 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:55:36,241 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:55:36,242 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2022-11-25 16:55:36,249 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/data/6801775c1/d20f3290778f451bb4a3beee254c553d/FLAG0f4086a13 [2022-11-25 16:55:36,269 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/data/6801775c1/d20f3290778f451bb4a3beee254c553d [2022-11-25 16:55:36,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:55:36,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:55:36,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:55:36,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:55:36,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:55:36,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26580c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36, skipping insertion in model container [2022-11-25 16:55:36,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:55:36,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:55:36,529 WARN L237 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_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2022-11-25 16:55:36,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:55:36,608 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:55:36,628 WARN L237 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_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2022-11-25 16:55:36,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:55:36,669 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:55:36,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36 WrapperNode [2022-11-25 16:55:36,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:55:36,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:55:36,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:55:36,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:55:36,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,716 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2022-11-25 16:55:36,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:55:36,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:55:36,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:55:36,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:55:36,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,749 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:55:36,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:55:36,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:55:36,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:55:36,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (1/1) ... [2022-11-25 16:55:36,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:55:36,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:36,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:55:36,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:55:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 16:55:36,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 16:55:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:55:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:55:36,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:55:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 16:55:36,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 16:55:36,950 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:55:36,952 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:55:37,187 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:55:37,193 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:55:37,203 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 16:55:37,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:55:37 BoogieIcfgContainer [2022-11-25 16:55:37,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:55:37,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:55:37,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:55:37,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:55:37,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:55:36" (1/3) ... [2022-11-25 16:55:37,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfea24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:55:37, skipping insertion in model container [2022-11-25 16:55:37,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:36" (2/3) ... [2022-11-25 16:55:37,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfea24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:55:37, skipping insertion in model container [2022-11-25 16:55:37,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:55:37" (3/3) ... [2022-11-25 16:55:37,214 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2022-11-25 16:55:37,259 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:55:37,259 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 16:55:37,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:55:37,354 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1cad905d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:55:37,355 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 16:55:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 16:55:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 16:55:37,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:37,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:37,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:37,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2022-11-25 16:55:37,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:37,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823704823] [2022-11-25 16:55:37,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:37,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:37,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 16:55:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:55:37,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:37,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823704823] [2022-11-25 16:55:37,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823704823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:37,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:37,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:55:37,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751049377] [2022-11-25 16:55:37,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:37,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:55:37,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:37,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:55:37,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:55:37,714 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 16:55:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:37,748 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2022-11-25 16:55:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:55:37,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-11-25 16:55:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:37,759 INFO L225 Difference]: With dead ends: 57 [2022-11-25 16:55:37,759 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 16:55:37,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:55:37,767 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:37,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 16:55:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-25 16:55:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 16:55:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-11-25 16:55:37,812 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2022-11-25 16:55:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:37,813 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-25 16:55:37,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 16:55:37,814 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-11-25 16:55:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 16:55:37,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:37,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:37,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:55:37,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:37,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2022-11-25 16:55:37,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:37,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118305273] [2022-11-25 16:55:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:38,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:38,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 16:55:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:55:38,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:38,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118305273] [2022-11-25 16:55:38,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118305273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:38,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:38,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:55:38,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095059940] [2022-11-25 16:55:38,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:38,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:55:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:38,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:55:38,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:55:38,059 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 16:55:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:38,104 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-11-25 16:55:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:55:38,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 19 [2022-11-25 16:55:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:38,107 INFO L225 Difference]: With dead ends: 38 [2022-11-25 16:55:38,107 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 16:55:38,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:55:38,109 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:38,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 16:55:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 16:55:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 16:55:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-11-25 16:55:38,116 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2022-11-25 16:55:38,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:38,118 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-25 16:55:38,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 16:55:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-11-25 16:55:38,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 16:55:38,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:38,120 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:38,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:55:38,121 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2022-11-25 16:55:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:38,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879317931] [2022-11-25 16:55:38,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:38,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:38,156 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:38,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531174965] [2022-11-25 16:55:38,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:38,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:38,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:38,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:38,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:55:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:38,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 16:55:38,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:55:38,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:55:38,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879317931] [2022-11-25 16:55:38,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531174965] [2022-11-25 16:55:38,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531174965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:38,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:38,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:55:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276728738] [2022-11-25 16:55:38,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:38,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:55:38,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:38,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:55:38,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:55:38,405 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 16:55:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:38,556 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-11-25 16:55:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:55:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-11-25 16:55:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:38,558 INFO L225 Difference]: With dead ends: 45 [2022-11-25 16:55:38,558 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 16:55:38,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:55:38,561 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:38,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 156 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:55:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 16:55:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-11-25 16:55:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 16:55:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2022-11-25 16:55:38,577 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2022-11-25 16:55:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:38,578 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2022-11-25 16:55:38,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 16:55:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2022-11-25 16:55:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 16:55:38,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:38,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:38,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:38,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:38,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2022-11-25 16:55:38,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:38,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596919279] [2022-11-25 16:55:38,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:38,795 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:38,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [365279062] [2022-11-25 16:55:38,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:38,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:38,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:38,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:38,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:55:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:38,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 16:55:38,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:55:39,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:55:39,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:39,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596919279] [2022-11-25 16:55:39,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:39,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365279062] [2022-11-25 16:55:39,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365279062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:39,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:39,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 16:55:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433808067] [2022-11-25 16:55:39,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:39,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:55:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:39,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:55:39,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:55:39,123 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 16:55:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:39,282 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-11-25 16:55:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:55:39,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-11-25 16:55:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:39,287 INFO L225 Difference]: With dead ends: 49 [2022-11-25 16:55:39,287 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 16:55:39,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:55:39,288 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:39,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 140 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:55:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 16:55:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-11-25 16:55:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 16:55:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2022-11-25 16:55:39,312 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2022-11-25 16:55:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:39,312 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-11-25 16:55:39,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 16:55:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-11-25 16:55:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 16:55:39,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:39,316 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:39,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:39,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:39,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2022-11-25 16:55:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:39,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10252849] [2022-11-25 16:55:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:39,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:39,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861184689] [2022-11-25 16:55:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:39,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:39,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:39,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:39,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:55:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:39,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 16:55:39,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:55:39,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:39,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10252849] [2022-11-25 16:55:39,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:39,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861184689] [2022-11-25 16:55:39,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861184689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:55:39,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:55:39,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-11-25 16:55:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15019088] [2022-11-25 16:55:39,975 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:39,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 16:55:39,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:39,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:55:39,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:55:39,977 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 16:55:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:40,246 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2022-11-25 16:55:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:55:40,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-11-25 16:55:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:40,250 INFO L225 Difference]: With dead ends: 71 [2022-11-25 16:55:40,250 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 16:55:40,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:55:40,252 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:40,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:55:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 16:55:40,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-25 16:55:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 39 states have internal predecessors, (47), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-25 16:55:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2022-11-25 16:55:40,269 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2022-11-25 16:55:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:40,269 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2022-11-25 16:55:40,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 16:55:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2022-11-25 16:55:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 16:55:40,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:40,271 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:40,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:40,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:40,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:40,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2022-11-25 16:55:40,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:40,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018688692] [2022-11-25 16:55:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:40,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:40,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271756722] [2022-11-25 16:55:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:40,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:40,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:40,504 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:40,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 16:55:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:40,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 16:55:40,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 16:55:40,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:55:40,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:40,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018688692] [2022-11-25 16:55:40,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:40,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271756722] [2022-11-25 16:55:40,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271756722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:40,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:40,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:55:40,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205220676] [2022-11-25 16:55:40,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:40,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:55:40,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:55:40,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:55:40,602 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 16:55:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:40,686 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2022-11-25 16:55:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:55:40,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-11-25 16:55:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:40,688 INFO L225 Difference]: With dead ends: 83 [2022-11-25 16:55:40,688 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 16:55:40,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:55:40,690 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:40,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 128 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:55:40,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 16:55:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-11-25 16:55:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 45 states have internal predecessors, (50), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-25 16:55:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2022-11-25 16:55:40,711 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2022-11-25 16:55:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:40,712 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2022-11-25 16:55:40,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 16:55:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-11-25 16:55:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 16:55:40,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:40,713 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:40,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:40,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:40,926 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:40,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2022-11-25 16:55:40,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:40,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440997915] [2022-11-25 16:55:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:40,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:40,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:40,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598331243] [2022-11-25 16:55:40,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:40,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:40,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:40,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:40,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 16:55:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:41,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:55:41,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 16:55:41,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 16:55:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:41,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440997915] [2022-11-25 16:55:41,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:41,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598331243] [2022-11-25 16:55:41,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598331243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:55:41,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:55:41,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-25 16:55:41,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922488849] [2022-11-25 16:55:41,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:41,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:55:41,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:41,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:55:41,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:55:41,157 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 16:55:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:41,346 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2022-11-25 16:55:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:55:41,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 38 [2022-11-25 16:55:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:41,349 INFO L225 Difference]: With dead ends: 218 [2022-11-25 16:55:41,349 INFO L226 Difference]: Without dead ends: 196 [2022-11-25 16:55:41,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:55:41,351 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 49 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:41,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 166 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:55:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-25 16:55:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2022-11-25 16:55:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 119 states have internal predecessors, (132), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2022-11-25 16:55:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2022-11-25 16:55:41,396 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2022-11-25 16:55:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:41,396 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2022-11-25 16:55:41,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 16:55:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2022-11-25 16:55:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 16:55:41,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:41,398 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:41,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:41,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:41,605 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2022-11-25 16:55:41,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:41,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092587291] [2022-11-25 16:55:41,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:41,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:41,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590075835] [2022-11-25 16:55:41,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:41,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:41,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:41,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:41,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 16:55:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:41,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 16:55:41,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 16:55:41,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092587291] [2022-11-25 16:55:41,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:41,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590075835] [2022-11-25 16:55:41,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590075835] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:55:41,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:55:41,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-11-25 16:55:41,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603197477] [2022-11-25 16:55:41,960 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:41,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:55:41,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:41,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:55:41,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:55:41,963 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:55:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:42,120 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2022-11-25 16:55:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:55:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-11-25 16:55:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:42,122 INFO L225 Difference]: With dead ends: 204 [2022-11-25 16:55:42,123 INFO L226 Difference]: Without dead ends: 199 [2022-11-25 16:55:42,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:55:42,127 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:42,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 107 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:55:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-25 16:55:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-11-25 16:55:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.205128205128205) internal successors, (141), 128 states have internal predecessors, (141), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-11-25 16:55:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2022-11-25 16:55:42,223 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2022-11-25 16:55:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:42,225 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2022-11-25 16:55:42,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 16:55:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2022-11-25 16:55:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 16:55:42,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:42,230 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:42,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:42,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 16:55:42,437 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2022-11-25 16:55:42,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:42,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785254693] [2022-11-25 16:55:42,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:42,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:42,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:42,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749098924] [2022-11-25 16:55:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:42,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:42,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:42,448 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:42,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 16:55:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:42,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 16:55:42,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 16:55:42,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 16:55:42,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:42,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785254693] [2022-11-25 16:55:42,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:42,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749098924] [2022-11-25 16:55:42,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749098924] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:55:42,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:55:42,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-11-25 16:55:42,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057062595] [2022-11-25 16:55:42,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:42,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 16:55:42,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:42,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 16:55:42,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-25 16:55:42,803 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 16:55:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:43,026 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2022-11-25 16:55:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:55:43,029 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 40 [2022-11-25 16:55:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:43,036 INFO L225 Difference]: With dead ends: 228 [2022-11-25 16:55:43,036 INFO L226 Difference]: Without dead ends: 212 [2022-11-25 16:55:43,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:55:43,039 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:43,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 111 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:55:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-25 16:55:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2022-11-25 16:55:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 138 states have internal predecessors, (148), 57 states have call successors, (57), 25 states have call predecessors, (57), 25 states have return successors, (53), 46 states have call predecessors, (53), 53 states have call successors, (53) [2022-11-25 16:55:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2022-11-25 16:55:43,083 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2022-11-25 16:55:43,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:43,084 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2022-11-25 16:55:43,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 16:55:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2022-11-25 16:55:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 16:55:43,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:43,092 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:43,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-25 16:55:43,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 16:55:43,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2022-11-25 16:55:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:43,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032993660] [2022-11-25 16:55:43,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:43,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:43,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:43,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693786438] [2022-11-25 16:55:43,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:55:43,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:43,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:43,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:43,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 16:55:43,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:55:43,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:55:43,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 16:55:43,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 16:55:43,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 16:55:43,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:43,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032993660] [2022-11-25 16:55:43,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:43,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693786438] [2022-11-25 16:55:43,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693786438] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:55:43,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:55:43,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-25 16:55:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564950806] [2022-11-25 16:55:43,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:43,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 16:55:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 16:55:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:55:43,789 INFO L87 Difference]: Start difference. First operand 210 states and 258 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-25 16:55:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:44,835 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2022-11-25 16:55:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:55:44,836 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 43 [2022-11-25 16:55:44,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:44,838 INFO L225 Difference]: With dead ends: 249 [2022-11-25 16:55:44,838 INFO L226 Difference]: Without dead ends: 225 [2022-11-25 16:55:44,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:55:44,839 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:44,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 147 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 16:55:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-25 16:55:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2022-11-25 16:55:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 133 states have (on average 1.1278195488721805) internal successors, (150), 141 states have internal predecessors, (150), 45 states have call successors, (45), 27 states have call predecessors, (45), 27 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-25 16:55:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2022-11-25 16:55:44,883 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2022-11-25 16:55:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:44,883 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2022-11-25 16:55:44,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-25 16:55:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2022-11-25 16:55:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 16:55:44,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:44,885 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:44,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:45,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:45,091 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:45,091 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2022-11-25 16:55:45,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:45,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937758245] [2022-11-25 16:55:45,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:45,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:45,100 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:45,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [230313195] [2022-11-25 16:55:45,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:45,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:45,102 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:45,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 16:55:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:45,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 16:55:45,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-25 16:55:45,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-25 16:55:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:45,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937758245] [2022-11-25 16:55:45,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:45,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230313195] [2022-11-25 16:55:45,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230313195] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:55:45,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:55:45,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2022-11-25 16:55:45,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173593085] [2022-11-25 16:55:45,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:45,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 16:55:45,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:45,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:55:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:55:45,796 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-25 16:55:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:46,490 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2022-11-25 16:55:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 16:55:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 57 [2022-11-25 16:55:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:46,498 INFO L225 Difference]: With dead ends: 218 [2022-11-25 16:55:46,498 INFO L226 Difference]: Without dead ends: 191 [2022-11-25 16:55:46,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-11-25 16:55:46,500 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 35 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:46,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 254 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 16:55:46,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-25 16:55:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2022-11-25 16:55:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.1129032258064515) internal successors, (138), 128 states have internal predecessors, (138), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-25 16:55:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2022-11-25 16:55:46,546 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2022-11-25 16:55:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:46,547 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2022-11-25 16:55:46,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-25 16:55:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2022-11-25 16:55:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-25 16:55:46,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:46,550 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:46,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:46,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 16:55:46,755 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:46,755 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2022-11-25 16:55:46,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:46,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574491345] [2022-11-25 16:55:46,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:46,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:46,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:46,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917680232] [2022-11-25 16:55:46,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:55:46,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:46,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:46,768 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:46,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 16:55:46,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:55:46,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:55:46,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 16:55:46,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-25 16:55:47,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-11-25 16:55:47,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:47,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574491345] [2022-11-25 16:55:47,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:47,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917680232] [2022-11-25 16:55:47,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917680232] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:55:47,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:55:47,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-25 16:55:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070309695] [2022-11-25 16:55:47,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:47,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 16:55:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:47,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 16:55:47,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:55:47,222 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2022-11-25 16:55:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:47,620 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2022-11-25 16:55:47,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 16:55:47,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 95 [2022-11-25 16:55:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:47,624 INFO L225 Difference]: With dead ends: 512 [2022-11-25 16:55:47,624 INFO L226 Difference]: Without dead ends: 503 [2022-11-25 16:55:47,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-11-25 16:55:47,626 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:47,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 251 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:55:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-11-25 16:55:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2022-11-25 16:55:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 334 states have (on average 1.095808383233533) internal successors, (366), 344 states have internal predecessors, (366), 102 states have call successors, (102), 66 states have call predecessors, (102), 66 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2022-11-25 16:55:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2022-11-25 16:55:47,807 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2022-11-25 16:55:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:47,808 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2022-11-25 16:55:47,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2022-11-25 16:55:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2022-11-25 16:55:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-25 16:55:47,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:47,816 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:47,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:48,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:48,022 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2022-11-25 16:55:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:48,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328340919] [2022-11-25 16:55:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:48,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:48,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [274594313] [2022-11-25 16:55:48,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:55:48,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:48,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:48,045 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:48,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 16:55:48,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-11-25 16:55:48,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:55:48,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 16:55:48,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-25 16:55:48,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2022-11-25 16:55:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:49,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328340919] [2022-11-25 16:55:49,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:49,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274594313] [2022-11-25 16:55:49,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274594313] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:55:49,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:55:49,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-25 16:55:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080364797] [2022-11-25 16:55:49,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:49,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 16:55:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:49,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 16:55:49,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-11-25 16:55:49,245 INFO L87 Difference]: Start difference. First operand 503 states and 568 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2022-11-25 16:55:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:50,231 INFO L93 Difference]: Finished difference Result 1148 states and 1345 transitions. [2022-11-25 16:55:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 16:55:50,233 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) Word has length 209 [2022-11-25 16:55:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:50,238 INFO L225 Difference]: With dead ends: 1148 [2022-11-25 16:55:50,238 INFO L226 Difference]: Without dead ends: 1139 [2022-11-25 16:55:50,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 16:55:50,240 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 157 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:50,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 360 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:55:50,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-11-25 16:55:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2022-11-25 16:55:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 754 states have (on average 1.090185676392573) internal successors, (822), 776 states have internal predecessors, (822), 234 states have call successors, (234), 150 states have call predecessors, (234), 150 states have return successors, (232), 212 states have call predecessors, (232), 232 states have call successors, (232) [2022-11-25 16:55:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1288 transitions. [2022-11-25 16:55:50,418 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1288 transitions. Word has length 209 [2022-11-25 16:55:50,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:50,419 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1288 transitions. [2022-11-25 16:55:50,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2022-11-25 16:55:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1288 transitions. [2022-11-25 16:55:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-11-25 16:55:50,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:50,432 INFO L195 NwaCegarLoop]: trace histogram [67, 66, 66, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:50,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-25 16:55:50,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:50,639 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:50,639 INFO L85 PathProgramCache]: Analyzing trace with hash -767722162, now seen corresponding path program 4 times [2022-11-25 16:55:50,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:50,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60167137] [2022-11-25 16:55:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:50,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:50,666 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:50,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784159703] [2022-11-25 16:55:50,666 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 16:55:50,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:50,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:50,668 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:50,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 16:55:50,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 16:55:50,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:55:50,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-25 16:55:50,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:55:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-11-25 16:55:51,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:55:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2022-11-25 16:55:53,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:53,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60167137] [2022-11-25 16:55:53,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:55:53,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784159703] [2022-11-25 16:55:53,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784159703] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:55:53,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:55:53,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-25 16:55:53,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336175246] [2022-11-25 16:55:53,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:55:53,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 16:55:53,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:53,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 16:55:53,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 16:55:53,268 INFO L87 Difference]: Start difference. First operand 1139 states and 1288 transitions. Second operand has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) [2022-11-25 16:55:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:56,010 INFO L93 Difference]: Finished difference Result 2420 states and 2833 transitions. [2022-11-25 16:55:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-25 16:55:56,011 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) Word has length 437 [2022-11-25 16:55:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:56,024 INFO L225 Difference]: With dead ends: 2420 [2022-11-25 16:55:56,024 INFO L226 Difference]: Without dead ends: 2411 [2022-11-25 16:55:56,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-11-25 16:55:56,029 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 401 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:56,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 809 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 16:55:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2022-11-25 16:55:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2411. [2022-11-25 16:55:56,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 1594 states have (on average 1.0878293601003763) internal successors, (1734), 1640 states have internal predecessors, (1734), 498 states have call successors, (498), 318 states have call predecessors, (498), 318 states have return successors, (496), 452 states have call predecessors, (496), 496 states have call successors, (496) [2022-11-25 16:55:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2728 transitions. [2022-11-25 16:55:56,495 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2728 transitions. Word has length 437 [2022-11-25 16:55:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:56,500 INFO L495 AbstractCegarLoop]: Abstraction has 2411 states and 2728 transitions. [2022-11-25 16:55:56,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) [2022-11-25 16:55:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2728 transitions. [2022-11-25 16:55:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2022-11-25 16:55:56,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:56,542 INFO L195 NwaCegarLoop]: trace histogram [139, 138, 138, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:56,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:56,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 16:55:56,748 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:55:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:56,749 INFO L85 PathProgramCache]: Analyzing trace with hash -776415410, now seen corresponding path program 5 times [2022-11-25 16:55:56,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:56,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254848538] [2022-11-25 16:55:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:56,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:55:56,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241194033] [2022-11-25 16:55:56,822 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 16:55:56,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:55:56,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:56,826 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:55:56,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:02:21,258 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2022-11-25 17:02:21,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:02:21,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-25 17:02:21,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 44597 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-11-25 17:02:24,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:02:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2022-11-25 17:02:27,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:27,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254848538] [2022-11-25 17:02:27,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:02:27,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241194033] [2022-11-25 17:02:27,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241194033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:02:27,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:02:27,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-25 17:02:27,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020867026] [2022-11-25 17:02:27,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:02:27,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-25 17:02:27,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:27,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-25 17:02:27,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-11-25 17:02:27,404 INFO L87 Difference]: Start difference. First operand 2411 states and 2728 transitions. Second operand has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) [2022-11-25 17:02:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:02:31,065 INFO L93 Difference]: Finished difference Result 2632 states and 2993 transitions. [2022-11-25 17:02:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-25 17:02:31,066 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) Word has length 893 [2022-11-25 17:02:31,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:02:31,082 INFO L225 Difference]: With dead ends: 2632 [2022-11-25 17:02:31,082 INFO L226 Difference]: Without dead ends: 2623 [2022-11-25 17:02:31,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1833 GetRequests, 1688 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-11-25 17:02:31,090 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 163 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:02:31,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 869 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 17:02:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2022-11-25 17:02:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2623. [2022-11-25 17:02:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 1734 states have (on average 1.0876585928489042) internal successors, (1886), 1784 states have internal predecessors, (1886), 542 states have call successors, (542), 346 states have call predecessors, (542), 346 states have return successors, (540), 492 states have call predecessors, (540), 540 states have call successors, (540) [2022-11-25 17:02:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 2968 transitions. [2022-11-25 17:02:31,675 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 2968 transitions. Word has length 893 [2022-11-25 17:02:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:02:31,678 INFO L495 AbstractCegarLoop]: Abstraction has 2623 states and 2968 transitions. [2022-11-25 17:02:31,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) [2022-11-25 17:02:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 2968 transitions. [2022-11-25 17:02:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2022-11-25 17:02:31,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:31,701 INFO L195 NwaCegarLoop]: trace histogram [151, 150, 150, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:31,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:02:31,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:02:31,911 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:02:31,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1208919630, now seen corresponding path program 6 times [2022-11-25 17:02:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:31,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21134147] [2022-11-25 17:02:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:31,970 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:02:31,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725981500] [2022-11-25 17:02:31,971 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:02:31,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:02:31,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:02:31,973 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:02:31,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:04:14,255 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2022-11-25 17:04:14,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:04:14,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:04:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:04:15,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:04:15,252 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:04:15,254 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:04:15,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:04:15,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 17:04:15,480 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:04:15,492 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:04:15,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:04:15 BoogieIcfgContainer [2022-11-25 17:04:15,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:04:15,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:04:15,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:04:15,820 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:04:15,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:55:37" (3/4) ... [2022-11-25 17:04:15,823 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:04:16,145 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:04:16,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:04:16,146 INFO L158 Benchmark]: Toolchain (without parser) took 519871.01ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 120.2MB in the beginning and 127.3MB in the end (delta: -7.1MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. [2022-11-25 17:04:16,146 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 104.9MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:04:16,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.95ms. Allocated memory is still 153.1MB. Free memory was 119.3MB in the beginning and 124.1MB in the end (delta: -4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 17:04:16,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.24ms. Allocated memory is still 153.1MB. Free memory was 124.1MB in the beginning and 122.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:04:16,149 INFO L158 Benchmark]: Boogie Preprocessor took 34.19ms. Allocated memory is still 153.1MB. Free memory was 122.3MB in the beginning and 121.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:04:16,150 INFO L158 Benchmark]: RCFGBuilder took 446.09ms. Allocated memory is still 153.1MB. Free memory was 121.1MB in the beginning and 109.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:04:16,150 INFO L158 Benchmark]: TraceAbstraction took 518611.89ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 109.4MB in the beginning and 158.8MB in the end (delta: -49.3MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2022-11-25 17:04:16,151 INFO L158 Benchmark]: Witness Printer took 325.39ms. Allocated memory is still 323.0MB. Free memory was 158.8MB in the beginning and 127.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-25 17:04:16,162 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.22ms. Allocated memory is still 104.9MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.95ms. Allocated memory is still 153.1MB. Free memory was 119.3MB in the beginning and 124.1MB in the end (delta: -4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.24ms. Allocated memory is still 153.1MB. Free memory was 124.1MB in the beginning and 122.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.19ms. Allocated memory is still 153.1MB. Free memory was 122.3MB in the beginning and 121.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.09ms. Allocated memory is still 153.1MB. Free memory was 121.1MB in the beginning and 109.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 518611.89ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 109.4MB in the beginning and 158.8MB in the end (delta: -49.3MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. * Witness Printer took 325.39ms. Allocated memory is still 323.0MB. Free memory was 158.8MB in the beginning and 127.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=103, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=103, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=103, b=2, counter=0, p=1, q=0, r=0, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=103, b=2, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=101, b=2, counter=1, p=1, q=0, r=-1, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=101, b=2, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=99, b=2, counter=2, p=1, q=0, r=-2, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=99, b=2, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=97, b=2, counter=3, p=1, q=0, r=-3, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=97, b=2, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=95, b=2, counter=4, p=1, q=0, r=-4, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=95, b=2, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=93, b=2, counter=5, p=1, q=0, r=-5, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=93, b=2, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=91, b=2, counter=6, p=1, q=0, r=-6, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=91, b=2, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=89, b=2, counter=7, p=1, q=0, r=-7, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=89, b=2, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=87, b=2, counter=8, p=1, q=0, r=-8, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=87, b=2, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=85, b=2, counter=9, p=1, q=0, r=-9, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=85, b=2, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=83, b=2, counter=10, p=1, q=0, r=-10, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=83, b=2, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=81, b=2, counter=11, p=1, q=0, r=-11, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=81, b=2, counter=12, counter++=11, p=1, q=0, r=-11, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=79, b=2, counter=12, p=1, q=0, r=-12, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=79, b=2, counter=13, counter++=12, p=1, q=0, r=-12, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=77, b=2, counter=13, p=1, q=0, r=-13, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=77, b=2, counter=14, counter++=13, p=1, q=0, r=-13, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=75, b=2, counter=14, p=1, q=0, r=-14, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=75, b=2, counter=15, counter++=14, p=1, q=0, r=-14, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=73, b=2, counter=15, p=1, q=0, r=-15, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=73, b=2, counter=16, counter++=15, p=1, q=0, r=-15, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=71, b=2, counter=16, p=1, q=0, r=-16, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=71, b=2, counter=17, counter++=16, p=1, q=0, r=-16, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=69, b=2, counter=17, p=1, q=0, r=-17, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=69, b=2, counter=18, counter++=17, p=1, q=0, r=-17, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=67, b=2, counter=18, p=1, q=0, r=-18, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=67, b=2, counter=19, counter++=18, p=1, q=0, r=-18, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=65, b=2, counter=19, p=1, q=0, r=-19, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=65, b=2, counter=20, counter++=19, p=1, q=0, r=-19, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=63, b=2, counter=20, p=1, q=0, r=-20, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=63, b=2, counter=21, counter++=20, p=1, q=0, r=-20, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=61, b=2, counter=21, p=1, q=0, r=-21, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=61, b=2, counter=22, counter++=21, p=1, q=0, r=-21, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=59, b=2, counter=22, p=1, q=0, r=-22, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=59, b=2, counter=23, counter++=22, p=1, q=0, r=-22, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=57, b=2, counter=23, p=1, q=0, r=-23, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=57, b=2, counter=24, counter++=23, p=1, q=0, r=-23, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=55, b=2, counter=24, p=1, q=0, r=-24, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=55, b=2, counter=25, counter++=24, p=1, q=0, r=-24, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=53, b=2, counter=25, p=1, q=0, r=-25, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=53, b=2, counter=26, counter++=25, p=1, q=0, r=-25, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=51, b=2, counter=26, p=1, q=0, r=-26, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=51, b=2, counter=27, counter++=26, p=1, q=0, r=-26, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=49, b=2, counter=27, p=1, q=0, r=-27, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=49, b=2, counter=28, counter++=27, p=1, q=0, r=-27, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=47, b=2, counter=28, p=1, q=0, r=-28, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=47, b=2, counter=29, counter++=28, p=1, q=0, r=-28, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=45, b=2, counter=29, p=1, q=0, r=-29, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=45, b=2, counter=30, counter++=29, p=1, q=0, r=-29, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=43, b=2, counter=30, p=1, q=0, r=-30, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=43, b=2, counter=31, counter++=30, p=1, q=0, r=-30, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=2, counter=31, p=1, q=0, r=-31, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=41, b=2, counter=32, counter++=31, p=1, q=0, r=-31, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=2, counter=32, p=1, q=0, r=-32, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=39, b=2, counter=33, counter++=32, p=1, q=0, r=-32, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=2, counter=33, p=1, q=0, r=-33, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=37, b=2, counter=34, counter++=33, p=1, q=0, r=-33, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=2, counter=34, p=1, q=0, r=-34, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=35, b=2, counter=35, counter++=34, p=1, q=0, r=-34, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=2, counter=35, p=1, q=0, r=-35, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=33, b=2, counter=36, counter++=35, p=1, q=0, r=-35, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=2, counter=36, p=1, q=0, r=-36, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=31, b=2, counter=37, counter++=36, p=1, q=0, r=-36, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=2, counter=37, p=1, q=0, r=-37, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=29, b=2, counter=38, counter++=37, p=1, q=0, r=-37, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=2, counter=38, p=1, q=0, r=-38, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=27, b=2, counter=39, counter++=38, p=1, q=0, r=-38, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=2, counter=39, p=1, q=0, r=-39, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=25, b=2, counter=40, counter++=39, p=1, q=0, r=-39, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=2, counter=40, p=1, q=0, r=-40, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=23, b=2, counter=41, counter++=40, p=1, q=0, r=-40, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=2, counter=41, p=1, q=0, r=-41, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=21, b=2, counter=42, counter++=41, p=1, q=0, r=-41, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=2, counter=42, p=1, q=0, r=-42, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=19, b=2, counter=43, counter++=42, p=1, q=0, r=-42, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=2, counter=43, p=1, q=0, r=-43, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=17, b=2, counter=44, counter++=43, p=1, q=0, r=-43, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=2, counter=44, p=1, q=0, r=-44, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=15, b=2, counter=45, counter++=44, p=1, q=0, r=-44, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=2, counter=45, p=1, q=0, r=-45, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=13, b=2, counter=46, counter++=45, p=1, q=0, r=-45, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=2, counter=46, p=1, q=0, r=-46, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=11, b=2, counter=47, counter++=46, p=1, q=0, r=-46, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=2, counter=47, p=1, q=0, r=-47, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=9, b=2, counter=48, counter++=47, p=1, q=0, r=-47, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=2, counter=48, p=1, q=0, r=-48, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=7, b=2, counter=49, counter++=48, p=1, q=0, r=-48, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=2, counter=49, p=1, q=0, r=-49, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=5, b=2, counter=50, counter++=49, p=1, q=0, r=-49, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=2, counter=50, p=1, q=0, r=-50, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=3, b=2, counter=51, counter++=50, p=1, q=0, r=-50, s=1, x=103, y=2] [L34] COND FALSE !(counter++<50) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 518.2s, OverallIterations: 16, TraceHistogramMax: 151, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1039 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1001 mSDsluCounter, 3725 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2863 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3295 IncrementalHoareTripleChecker+Invalid, 3583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 862 mSDtfsCounter, 3295 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3931 GetRequests, 3522 SyntacticMatches, 48 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4098 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2623occurred in iteration=15, InterpolantAutomatonStates: 349, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 487.0s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 2963 NumberOfCodeBlocks, 2948 NumberOfCodeBlocksAsserted, 224 NumberOfCheckSat, 3783 ConstructedInterpolants, 0 QuantifiedInterpolants, 9656 SizeOfPredicates, 112 NumberOfNonLiveVariables, 4531 ConjunctsInSsa, 344 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 50778/117029 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 17:04:16,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5be0d60-8c35-45b6-9a39-ddb9b96cb10d/bin/uautomizer-ZsLfNo2U6R/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