./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5161832faa85efa7698287d22f9a23de4fa8b958c1b2d2c225d3d8c999a24ce --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 11:52:24,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 11:52:24,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 11:52:24,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 11:52:24,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 11:52:24,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 11:52:24,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 11:52:24,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 11:52:24,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 11:52:24,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 11:52:24,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 11:52:24,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 11:52:24,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 11:52:24,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 11:52:24,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 11:52:24,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 11:52:24,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 11:52:24,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 11:52:24,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 11:52:24,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 11:52:24,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 11:52:24,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 11:52:24,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 11:52:24,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 11:52:24,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 11:52:24,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 11:52:24,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 11:52:24,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 11:52:24,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 11:52:24,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 11:52:24,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 11:52:24,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 11:52:24,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 11:52:24,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 11:52:24,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 11:52:24,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 11:52:24,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 11:52:24,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 11:52:24,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 11:52:24,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 11:52:24,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 11:52:24,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 11:52:24,315 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 11:52:24,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 11:52:24,316 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 11:52:24,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 11:52:24,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 11:52:24,318 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 11:52:24,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 11:52:24,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 11:52:24,318 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 11:52:24,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 11:52:24,319 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 11:52:24,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 11:52:24,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 11:52:24,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 11:52:24,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 11:52:24,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 11:52:24,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 11:52:24,321 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 11:52:24,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 11:52:24,321 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 11:52:24,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 11:52:24,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 11:52:24,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 11:52:24,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 11:52:24,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 11:52:24,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 11:52:24,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 11:52:24,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 11:52:24,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 11:52:24,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 11:52:24,324 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 11:52:24,324 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 11:52:24,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 11:52:24,324 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 11:52:24,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5161832faa85efa7698287d22f9a23de4fa8b958c1b2d2c225d3d8c999a24ce [2021-12-17 11:52:24,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 11:52:24,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 11:52:24,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 11:52:24,529 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 11:52:24,529 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 11:52:24,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c [2021-12-17 11:52:24,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ed74910/1dede3b69c18471890f35ef21042399f/FLAGf101cffb3 [2021-12-17 11:52:24,943 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 11:52:24,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c [2021-12-17 11:52:24,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ed74910/1dede3b69c18471890f35ef21042399f/FLAGf101cffb3 [2021-12-17 11:52:25,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ed74910/1dede3b69c18471890f35ef21042399f [2021-12-17 11:52:25,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 11:52:25,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 11:52:25,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 11:52:25,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 11:52:25,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 11:52:25,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e5926e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25, skipping insertion in model container [2021-12-17 11:52:25,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 11:52:25,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 11:52:25,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c[489,502] [2021-12-17 11:52:25,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 11:52:25,533 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 11:52:25,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c[489,502] [2021-12-17 11:52:25,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 11:52:25,555 INFO L208 MainTranslator]: Completed translation [2021-12-17 11:52:25,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25 WrapperNode [2021-12-17 11:52:25,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 11:52:25,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 11:52:25,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 11:52:25,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 11:52:25,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,577 INFO L137 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2021-12-17 11:52:25,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 11:52:25,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 11:52:25,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 11:52:25,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 11:52:25,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 11:52:25,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 11:52:25,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 11:52:25,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 11:52:25,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (1/1) ... [2021-12-17 11:52:25,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 11:52:25,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:25,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 11:52:25,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 11:52:25,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 11:52:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-17 11:52:25,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-17 11:52:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 11:52:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 11:52:25,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 11:52:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 11:52:25,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 11:52:25,707 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 11:52:25,708 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 11:52:25,797 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 11:52:25,801 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 11:52:25,802 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 11:52:25,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:52:25 BoogieIcfgContainer [2021-12-17 11:52:25,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 11:52:25,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 11:52:25,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 11:52:25,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 11:52:25,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:52:25" (1/3) ... [2021-12-17 11:52:25,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4ef314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:52:25, skipping insertion in model container [2021-12-17 11:52:25,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:52:25" (2/3) ... [2021-12-17 11:52:25,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4ef314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:52:25, skipping insertion in model container [2021-12-17 11:52:25,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:52:25" (3/3) ... [2021-12-17 11:52:25,810 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound100.c [2021-12-17 11:52:25,813 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 11:52:25,813 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 11:52:25,843 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 11:52:25,848 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 11:52:25,849 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 11:52:25,860 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) [2021-12-17 11:52:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 11:52:25,863 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:25,864 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:52:25,864 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:25,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:25,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2021-12-17 11:52:25,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:25,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531876889] [2021-12-17 11:52:25,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:25,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:25,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 11:52:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:25,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 11:52:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 11:52:26,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:26,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531876889] [2021-12-17 11:52:26,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531876889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:52:26,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:52:26,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 11:52:26,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801398379] [2021-12-17 11:52:26,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:52:26,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 11:52:26,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:26,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 11:52:26,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 11:52:26,064 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) [2021-12-17 11:52:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:26,088 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2021-12-17 11:52:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 11:52:26,090 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 [2021-12-17 11:52:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:26,096 INFO L225 Difference]: With dead ends: 57 [2021-12-17 11:52:26,096 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 11:52:26,100 INFO L932 BasicCegarLoop]: 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 [2021-12-17 11:52:26,107 INFO L933 BasicCegarLoop]: 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 [2021-12-17 11:52:26,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:52:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 11:52:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-17 11:52:26,138 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) [2021-12-17 11:52:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-12-17 11:52:26,140 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2021-12-17 11:52:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:26,140 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-17 11:52:26,141 INFO L471 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) [2021-12-17 11:52:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2021-12-17 11:52:26,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 11:52:26,142 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:26,142 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:52:26,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 11:52:26,143 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:26,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2021-12-17 11:52:26,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:26,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533128564] [2021-12-17 11:52:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:26,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:26,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 11:52:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:26,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 11:52:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 11:52:26,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:26,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533128564] [2021-12-17 11:52:26,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533128564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:52:26,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:52:26,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 11:52:26,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519703459] [2021-12-17 11:52:26,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:52:26,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 11:52:26,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:26,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 11:52:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 11:52:26,228 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) [2021-12-17 11:52:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:26,261 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2021-12-17 11:52:26,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 11:52:26,265 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 [2021-12-17 11:52:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:26,265 INFO L225 Difference]: With dead ends: 38 [2021-12-17 11:52:26,265 INFO L226 Difference]: Without dead ends: 28 [2021-12-17 11:52:26,266 INFO L932 BasicCegarLoop]: 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 [2021-12-17 11:52:26,267 INFO L933 BasicCegarLoop]: 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 [2021-12-17 11:52:26,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:52:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-17 11:52:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-17 11:52:26,277 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) [2021-12-17 11:52:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-12-17 11:52:26,279 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2021-12-17 11:52:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:26,282 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-17 11:52:26,283 INFO L471 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) [2021-12-17 11:52:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2021-12-17 11:52:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 11:52:26,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:26,285 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:52:26,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 11:52:26,286 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:26,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:26,287 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2021-12-17 11:52:26,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:26,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711447662] [2021-12-17 11:52:26,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:26,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:26,298 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:26,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [69053739] [2021-12-17 11:52:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:26,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:26,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:26,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:26,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 11:52:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:26,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 11:52:26,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 11:52:26,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 11:52:26,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:26,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711447662] [2021-12-17 11:52:26,515 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:26,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69053739] [2021-12-17 11:52:26,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69053739] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:52:26,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:52:26,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 11:52:26,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073272304] [2021-12-17 11:52:26,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:52:26,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 11:52:26,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:26,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 11:52:26,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 11:52:26,518 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 11:52:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:26,557 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2021-12-17 11:52:26,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 11:52:26,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 [2021-12-17 11:52:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:26,558 INFO L225 Difference]: With dead ends: 45 [2021-12-17 11:52:26,558 INFO L226 Difference]: Without dead ends: 43 [2021-12-17 11:52:26,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 11:52:26,559 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:26,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 136 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:52:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-17 11:52:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-12-17 11:52:26,567 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) [2021-12-17 11:52:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2021-12-17 11:52:26,568 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2021-12-17 11:52:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:26,568 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2021-12-17 11:52:26,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 11:52:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2021-12-17 11:52:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 11:52:26,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:26,569 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:52:26,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:26,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:26,789 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:26,790 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2021-12-17 11:52:26,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:26,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373139094] [2021-12-17 11:52:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:26,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:26,799 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:26,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [782253875] [2021-12-17 11:52:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:26,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:26,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:26,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:26,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 11:52:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:26,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-17 11:52:26,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 11:52:27,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 11:52:27,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:27,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373139094] [2021-12-17 11:52:27,060 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:27,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782253875] [2021-12-17 11:52:27,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782253875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:52:27,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:52:27,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 11:52:27,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348187500] [2021-12-17 11:52:27,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:52:27,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 11:52:27,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:27,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 11:52:27,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-17 11:52:27,062 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 11:52:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:27,148 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2021-12-17 11:52:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 11:52:27,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2021-12-17 11:52:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:27,149 INFO L225 Difference]: With dead ends: 49 [2021-12-17 11:52:27,149 INFO L226 Difference]: Without dead ends: 47 [2021-12-17 11:52:27,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-17 11:52:27,150 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:27,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 194 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 11:52:27,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-17 11:52:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-12-17 11:52:27,156 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) [2021-12-17 11:52:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2021-12-17 11:52:27,158 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2021-12-17 11:52:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:27,158 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-12-17 11:52:27,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 11:52:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2021-12-17 11:52:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 11:52:27,159 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:27,159 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:52:27,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-17 11:52:27,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 11:52:27,378 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2021-12-17 11:52:27,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:27,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925157955] [2021-12-17 11:52:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:27,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:27,387 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:27,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424570008] [2021-12-17 11:52:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:27,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:27,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:27,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:27,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 11:52:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:27,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-17 11:52:27,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 11:52:27,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 11:52:27,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:27,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925157955] [2021-12-17 11:52:27,587 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:27,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424570008] [2021-12-17 11:52:27,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424570008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:52:27,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:52:27,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 11:52:27,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579625432] [2021-12-17 11:52:27,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:52:27,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 11:52:27,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:27,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 11:52:27,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-17 11:52:27,589 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 11:52:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:27,678 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2021-12-17 11:52:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 11:52:27,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2021-12-17 11:52:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:27,681 INFO L225 Difference]: With dead ends: 71 [2021-12-17 11:52:27,681 INFO L226 Difference]: Without dead ends: 67 [2021-12-17 11:52:27,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-17 11:52:27,682 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 49 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:27,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 165 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 11:52:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-17 11:52:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-17 11:52:27,691 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) [2021-12-17 11:52:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2021-12-17 11:52:27,692 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2021-12-17 11:52:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:27,693 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2021-12-17 11:52:27,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 11:52:27,693 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2021-12-17 11:52:27,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 11:52:27,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:27,694 INFO L514 BasicCegarLoop]: 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] [2021-12-17 11:52:27,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:27,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:27,911 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:27,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2021-12-17 11:52:27,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:27,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933350254] [2021-12-17 11:52:27,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:27,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:27,925 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:27,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474094943] [2021-12-17 11:52:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:27,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:27,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:27,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:27,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 11:52:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:27,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 11:52:27,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 11:52:28,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 11:52:28,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:28,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933350254] [2021-12-17 11:52:28,014 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:28,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474094943] [2021-12-17 11:52:28,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474094943] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:52:28,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:52:28,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 11:52:28,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654780766] [2021-12-17 11:52:28,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:52:28,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 11:52:28,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:28,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 11:52:28,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 11:52:28,016 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) [2021-12-17 11:52:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:28,054 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2021-12-17 11:52:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 11:52:28,055 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 [2021-12-17 11:52:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:28,058 INFO L225 Difference]: With dead ends: 83 [2021-12-17 11:52:28,058 INFO L226 Difference]: Without dead ends: 81 [2021-12-17 11:52:28,059 INFO L932 BasicCegarLoop]: 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 [2021-12-17 11:52:28,062 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:28,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 137 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:52:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-17 11:52:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2021-12-17 11:52:28,085 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) [2021-12-17 11:52:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2021-12-17 11:52:28,089 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2021-12-17 11:52:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:28,091 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2021-12-17 11:52:28,092 INFO L471 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) [2021-12-17 11:52:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2021-12-17 11:52:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 11:52:28,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:28,094 INFO L514 BasicCegarLoop]: 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] [2021-12-17 11:52:28,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:28,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:28,313 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:28,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2021-12-17 11:52:28,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:28,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287083091] [2021-12-17 11:52:28,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:28,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:28,352 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:28,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880693582] [2021-12-17 11:52:28,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:28,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:28,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:28,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:28,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 11:52:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:28,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 11:52:28,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 11:52:28,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:52:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 11:52:28,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:28,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287083091] [2021-12-17 11:52:28,553 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:28,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880693582] [2021-12-17 11:52:28,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880693582] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:52:28,553 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:52:28,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-17 11:52:28,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829302609] [2021-12-17 11:52:28,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:52:28,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 11:52:28,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:28,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 11:52:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-17 11:52:28,555 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) [2021-12-17 11:52:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:28,632 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2021-12-17 11:52:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 11:52:28,632 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 [2021-12-17 11:52:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:28,634 INFO L225 Difference]: With dead ends: 218 [2021-12-17 11:52:28,634 INFO L226 Difference]: Without dead ends: 196 [2021-12-17 11:52:28,634 INFO L932 BasicCegarLoop]: 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 [2021-12-17 11:52:28,635 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 56 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:28,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 213 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:52:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-17 11:52:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2021-12-17 11:52:28,651 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) [2021-12-17 11:52:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2021-12-17 11:52:28,653 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2021-12-17 11:52:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:28,653 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2021-12-17 11:52:28,653 INFO L471 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) [2021-12-17 11:52:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2021-12-17 11:52:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 11:52:28,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:28,654 INFO L514 BasicCegarLoop]: 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] [2021-12-17 11:52:28,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:28,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:28,872 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:28,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:28,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2021-12-17 11:52:28,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:28,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788270419] [2021-12-17 11:52:28,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:28,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:28,890 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:28,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658081935] [2021-12-17 11:52:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:28,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:28,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:28,892 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:28,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 11:52:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:28,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 11:52:28,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-17 11:52:29,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 11:52:29,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:29,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788270419] [2021-12-17 11:52:29,058 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:29,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658081935] [2021-12-17 11:52:29,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658081935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 11:52:29,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 11:52:29,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 11:52:29,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231965533] [2021-12-17 11:52:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:52:29,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 11:52:29,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:29,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 11:52:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 11:52:29,065 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 11:52:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:29,093 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2021-12-17 11:52:29,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 11:52:29,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2021-12-17 11:52:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:29,095 INFO L225 Difference]: With dead ends: 204 [2021-12-17 11:52:29,095 INFO L226 Difference]: Without dead ends: 199 [2021-12-17 11:52:29,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 11:52:29,096 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:29,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:52:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-17 11:52:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-12-17 11:52:29,108 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) [2021-12-17 11:52:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2021-12-17 11:52:29,109 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2021-12-17 11:52:29,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:29,109 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2021-12-17 11:52:29,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 11:52:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2021-12-17 11:52:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 11:52:29,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:29,111 INFO L514 BasicCegarLoop]: 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] [2021-12-17 11:52:29,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:29,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:29,328 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:29,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2021-12-17 11:52:29,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:29,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789188789] [2021-12-17 11:52:29,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:29,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:29,334 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:29,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817044082] [2021-12-17 11:52:29,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:29,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:29,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:29,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:29,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 11:52:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:29,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 11:52:29,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-17 11:52:29,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:52:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-17 11:52:29,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:29,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789188789] [2021-12-17 11:52:29,617 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:29,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817044082] [2021-12-17 11:52:29,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817044082] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:52:29,618 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:52:29,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-12-17 11:52:29,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586890613] [2021-12-17 11:52:29,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:52:29,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 11:52:29,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:29,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 11:52:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-17 11:52:29,619 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 11:52:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:29,722 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2021-12-17 11:52:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 11:52:29,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2021-12-17 11:52:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:29,724 INFO L225 Difference]: With dead ends: 228 [2021-12-17 11:52:29,724 INFO L226 Difference]: Without dead ends: 212 [2021-12-17 11:52:29,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-17 11:52:29,725 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:29,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 137 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 11:52:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-17 11:52:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2021-12-17 11:52:29,737 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) [2021-12-17 11:52:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2021-12-17 11:52:29,738 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2021-12-17 11:52:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:29,739 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2021-12-17 11:52:29,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-17 11:52:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2021-12-17 11:52:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 11:52:29,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:29,740 INFO L514 BasicCegarLoop]: 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] [2021-12-17 11:52:29,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:29,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:29,957 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2021-12-17 11:52:29,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:29,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788847215] [2021-12-17 11:52:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:29,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:29,964 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:29,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242118456] [2021-12-17 11:52:29,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 11:52:29,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:29,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:29,966 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:29,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 11:52:29,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 11:52:29,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:52:29,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-17 11:52:29,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-17 11:52:30,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:52:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-17 11:52:30,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:30,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788847215] [2021-12-17 11:52:30,251 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:30,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242118456] [2021-12-17 11:52:30,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242118456] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:52:30,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:52:30,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-17 11:52:30,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105271432] [2021-12-17 11:52:30,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:52:30,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 11:52:30,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:30,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 11:52:30,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 11:52:30,253 INFO L87 Difference]: Start difference. First operand 210 states and 258 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 11:52:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:30,615 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2021-12-17 11:52:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 11:52:30,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 43 [2021-12-17 11:52:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:30,617 INFO L225 Difference]: With dead ends: 249 [2021-12-17 11:52:30,618 INFO L226 Difference]: Without dead ends: 225 [2021-12-17 11:52:30,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-17 11:52:30,618 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:30,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 186 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 11:52:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-17 11:52:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2021-12-17 11:52:30,631 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) [2021-12-17 11:52:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2021-12-17 11:52:30,632 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2021-12-17 11:52:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:30,632 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2021-12-17 11:52:30,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 11:52:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2021-12-17 11:52:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 11:52:30,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:30,633 INFO L514 BasicCegarLoop]: 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] [2021-12-17 11:52:30,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:30,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 11:52:30,849 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:30,849 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2021-12-17 11:52:30,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:30,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246378864] [2021-12-17 11:52:30,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:30,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:30,855 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:30,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635241258] [2021-12-17 11:52:30,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:30,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:30,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:30,857 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:30,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 11:52:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 11:52:30,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 11:52:30,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-17 11:52:31,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:52:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-17 11:52:31,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:31,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246378864] [2021-12-17 11:52:31,206 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:31,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635241258] [2021-12-17 11:52:31,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635241258] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 11:52:31,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 11:52:31,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2021-12-17 11:52:31,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246444381] [2021-12-17 11:52:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 11:52:31,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 11:52:31,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:31,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 11:52:31,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 11:52:31,207 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 11:52:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:31,233 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2021-12-17 11:52:31,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 11:52:31,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-12-17 11:52:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:31,235 INFO L225 Difference]: With dead ends: 212 [2021-12-17 11:52:31,235 INFO L226 Difference]: Without dead ends: 188 [2021-12-17 11:52:31,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-17 11:52:31,236 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:31,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 11:52:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-17 11:52:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2021-12-17 11:52:31,245 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) [2021-12-17 11:52:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2021-12-17 11:52:31,245 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2021-12-17 11:52:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:31,246 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2021-12-17 11:52:31,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 11:52:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2021-12-17 11:52:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-17 11:52:31,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:31,260 INFO L514 BasicCegarLoop]: 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] [2021-12-17 11:52:31,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:31,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:31,460 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:31,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:31,461 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2021-12-17 11:52:31,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:31,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271190111] [2021-12-17 11:52:31,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:31,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:31,467 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:31,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101847445] [2021-12-17 11:52:31,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 11:52:31,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:31,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:31,469 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:31,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 11:52:31,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 11:52:31,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:52:31,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 11:52:31,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-17 11:52:31,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:52:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-12-17 11:52:31,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271190111] [2021-12-17 11:52:31,827 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101847445] [2021-12-17 11:52:31,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101847445] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:52:31,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:52:31,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-17 11:52:31,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088058327] [2021-12-17 11:52:31,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:52:31,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 11:52:31,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:31,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 11:52:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-17 11:52:31,829 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) [2021-12-17 11:52:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:32,031 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2021-12-17 11:52:32,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 11:52:32,031 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 [2021-12-17 11:52:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:32,033 INFO L225 Difference]: With dead ends: 512 [2021-12-17 11:52:32,033 INFO L226 Difference]: Without dead ends: 503 [2021-12-17 11:52:32,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-12-17 11:52:32,034 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 131 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:32,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 242 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 11:52:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-12-17 11:52:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2021-12-17 11:52:32,059 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) [2021-12-17 11:52:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2021-12-17 11:52:32,061 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2021-12-17 11:52:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:32,061 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2021-12-17 11:52:32,061 INFO L471 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) [2021-12-17 11:52:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2021-12-17 11:52:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-12-17 11:52:32,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:32,063 INFO L514 BasicCegarLoop]: 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] [2021-12-17 11:52:32,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:32,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 11:52:32,296 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:32,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2021-12-17 11:52:32,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:32,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601374946] [2021-12-17 11:52:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:32,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:32,314 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:32,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1261242439] [2021-12-17 11:52:32,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 11:52:32,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:32,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:32,316 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:32,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 11:52:32,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2021-12-17 11:52:32,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:52:32,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 11:52:32,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-12-17 11:52:32,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:52:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2021-12-17 11:52:33,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:33,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601374946] [2021-12-17 11:52:33,124 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:33,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261242439] [2021-12-17 11:52:33,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261242439] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:52:33,125 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:52:33,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-12-17 11:52:33,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564604454] [2021-12-17 11:52:33,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:52:33,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 11:52:33,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:33,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 11:52:33,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-12-17 11:52:33,127 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) [2021-12-17 11:52:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:33,650 INFO L93 Difference]: Finished difference Result 1148 states and 1345 transitions. [2021-12-17 11:52:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-17 11:52:33,651 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 [2021-12-17 11:52:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:33,655 INFO L225 Difference]: With dead ends: 1148 [2021-12-17 11:52:33,655 INFO L226 Difference]: Without dead ends: 1139 [2021-12-17 11:52:33,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2021-12-17 11:52:33,657 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 252 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:33,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 431 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 11:52:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-12-17 11:52:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2021-12-17 11:52:33,704 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) [2021-12-17 11:52:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1288 transitions. [2021-12-17 11:52:33,707 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1288 transitions. Word has length 209 [2021-12-17 11:52:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:33,708 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 1288 transitions. [2021-12-17 11:52:33,708 INFO L471 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) [2021-12-17 11:52:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1288 transitions. [2021-12-17 11:52:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-12-17 11:52:33,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:33,714 INFO L514 BasicCegarLoop]: 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] [2021-12-17 11:52:33,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:33,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 11:52:33,935 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:33,935 INFO L85 PathProgramCache]: Analyzing trace with hash -767722162, now seen corresponding path program 4 times [2021-12-17 11:52:33,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:33,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125654796] [2021-12-17 11:52:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:33,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:33,953 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:33,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460446094] [2021-12-17 11:52:33,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 11:52:33,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:33,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:33,965 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:33,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 11:52:34,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 11:52:34,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:52:34,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-17 11:52:34,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:52:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-12-17 11:52:34,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:52:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2021-12-17 11:52:35,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:52:35,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125654796] [2021-12-17 11:52:35,932 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:52:35,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460446094] [2021-12-17 11:52:35,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460446094] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:52:35,932 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:52:35,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-12-17 11:52:35,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371528594] [2021-12-17 11:52:35,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:52:35,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-17 11:52:35,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:52:35,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-17 11:52:35,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-12-17 11:52:35,936 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) [2021-12-17 11:52:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:52:37,416 INFO L93 Difference]: Finished difference Result 2420 states and 2833 transitions. [2021-12-17 11:52:37,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-17 11:52:37,417 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 [2021-12-17 11:52:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:52:37,425 INFO L225 Difference]: With dead ends: 2420 [2021-12-17 11:52:37,425 INFO L226 Difference]: Without dead ends: 2411 [2021-12-17 11:52:37,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2021-12-17 11:52:37,428 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 511 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 11:52:37,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 657 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 11:52:37,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2021-12-17 11:52:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2411. [2021-12-17 11:52:37,524 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) [2021-12-17 11:52:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2728 transitions. [2021-12-17 11:52:37,531 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2728 transitions. Word has length 437 [2021-12-17 11:52:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:52:37,532 INFO L470 AbstractCegarLoop]: Abstraction has 2411 states and 2728 transitions. [2021-12-17 11:52:37,532 INFO L471 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) [2021-12-17 11:52:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2728 transitions. [2021-12-17 11:52:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2021-12-17 11:52:37,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:52:37,548 INFO L514 BasicCegarLoop]: 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] [2021-12-17 11:52:37,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 11:52:37,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-17 11:52:37,767 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:52:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:52:37,767 INFO L85 PathProgramCache]: Analyzing trace with hash -776415410, now seen corresponding path program 5 times [2021-12-17 11:52:37,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:52:37,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734757660] [2021-12-17 11:52:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:52:37,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:52:37,799 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:52:37,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386645838] [2021-12-17 11:52:37,799 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 11:52:37,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:52:37,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:52:37,807 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:52:37,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 11:53:21,433 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2021-12-17 11:53:21,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:53:21,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-17 11:53:21,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:53:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 44597 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-12-17 11:53:23,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:53:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2021-12-17 11:53:26,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:53:26,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734757660] [2021-12-17 11:53:26,443 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:53:26,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386645838] [2021-12-17 11:53:26,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386645838] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:53:26,444 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:53:26,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2021-12-17 11:53:26,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155782866] [2021-12-17 11:53:26,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:53:26,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-12-17 11:53:26,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:53:26,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-12-17 11:53:26,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2021-12-17 11:53:26,456 INFO L87 Difference]: Start difference. First operand 2411 states and 2728 transitions. Second operand has 98 states, 98 states have (on average 5.387755102040816) internal successors, (528), 98 states have internal predecessors, (528), 95 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 94 states have call predecessors, (280), 94 states have call successors, (280) [2021-12-17 11:53:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:53:32,553 INFO L93 Difference]: Finished difference Result 4964 states and 5809 transitions. [2021-12-17 11:53:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-12-17 11:53:32,554 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 5.387755102040816) internal successors, (528), 98 states have internal predecessors, (528), 95 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 94 states have call predecessors, (280), 94 states have call successors, (280) Word has length 893 [2021-12-17 11:53:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:53:32,572 INFO L225 Difference]: With dead ends: 4964 [2021-12-17 11:53:32,573 INFO L226 Difference]: Without dead ends: 4955 [2021-12-17 11:53:32,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1877 GetRequests, 1688 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2021-12-17 11:53:32,582 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 1582 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 1104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1104 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-17 11:53:32,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1582 Valid, 1233 Invalid, 2883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1104 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-17 11:53:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2021-12-17 11:53:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 4955. [2021-12-17 11:53:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4955 states, 3274 states have (on average 1.0867440439828955) internal successors, (3558), 3368 states have internal predecessors, (3558), 1026 states have call successors, (1026), 654 states have call predecessors, (1026), 654 states have return successors, (1024), 932 states have call predecessors, (1024), 1024 states have call successors, (1024) [2021-12-17 11:53:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 5608 transitions. [2021-12-17 11:53:32,898 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 5608 transitions. Word has length 893 [2021-12-17 11:53:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:53:32,916 INFO L470 AbstractCegarLoop]: Abstraction has 4955 states and 5608 transitions. [2021-12-17 11:53:32,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 5.387755102040816) internal successors, (528), 98 states have internal predecessors, (528), 95 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 94 states have call predecessors, (280), 94 states have call successors, (280) [2021-12-17 11:53:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 5608 transitions. [2021-12-17 11:53:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1806 [2021-12-17 11:53:32,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:53:32,993 INFO L514 BasicCegarLoop]: trace histogram [283, 282, 282, 95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:53:33,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-17 11:53:33,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 11:53:33,211 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:53:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:53:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1655802702, now seen corresponding path program 6 times [2021-12-17 11:53:33,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:53:33,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29495111] [2021-12-17 11:53:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:53:33,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:53:33,276 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:53:33,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922522401] [2021-12-17 11:53:33,277 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 11:53:33,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:53:33,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:53:33,287 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:53:33,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-17 11:53:57,163 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 179 check-sat command(s) [2021-12-17 11:53:57,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 11:53:57,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 3826 conjuncts, 191 conjunts are in the unsatisfiable core [2021-12-17 11:53:57,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 11:54:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 188141 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2021-12-17 11:54:02,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 11:54:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 30785 refuted. 0 times theorem prover too weak. 158488 trivial. 0 not checked. [2021-12-17 11:54:05,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 11:54:05,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29495111] [2021-12-17 11:54:05,582 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 11:54:05,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922522401] [2021-12-17 11:54:05,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922522401] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 11:54:05,583 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 11:54:05,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2021-12-17 11:54:05,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529311152] [2021-12-17 11:54:05,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 11:54:05,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-12-17 11:54:05,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 11:54:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-12-17 11:54:05,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2021-12-17 11:54:05,588 INFO L87 Difference]: Start difference. First operand 4955 states and 5608 transitions. Second operand has 104 states, 104 states have (on average 6.730769230769231) internal successors, (700), 104 states have internal predecessors, (700), 101 states have call successors, (569), 97 states have call predecessors, (569), 96 states have return successors, (568), 100 states have call predecessors, (568), 100 states have call successors, (568) [2021-12-17 11:54:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 11:54:11,020 INFO L93 Difference]: Finished difference Result 5282 states and 6001 transitions. [2021-12-17 11:54:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-12-17 11:54:11,021 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 6.730769230769231) internal successors, (700), 104 states have internal predecessors, (700), 101 states have call successors, (569), 97 states have call predecessors, (569), 96 states have return successors, (568), 100 states have call predecessors, (568), 100 states have call successors, (568) Word has length 1805 [2021-12-17 11:54:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 11:54:11,038 INFO L225 Difference]: With dead ends: 5282 [2021-12-17 11:54:11,038 INFO L226 Difference]: Without dead ends: 5273 [2021-12-17 11:54:11,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3707 GetRequests, 3505 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5055 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2021-12-17 11:54:11,043 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 1368 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 881 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-17 11:54:11,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1368 Valid, 1287 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [881 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-17 11:54:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5273 states. [2021-12-17 11:54:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5273 to 5273. [2021-12-17 11:54:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 3484 states have (on average 1.0866819747416763) internal successors, (3786), 3584 states have internal predecessors, (3786), 1092 states have call successors, (1092), 696 states have call predecessors, (1092), 696 states have return successors, (1090), 992 states have call predecessors, (1090), 1090 states have call successors, (1090) [2021-12-17 11:54:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 5968 transitions. [2021-12-17 11:54:11,267 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 5968 transitions. Word has length 1805 [2021-12-17 11:54:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 11:54:11,271 INFO L470 AbstractCegarLoop]: Abstraction has 5273 states and 5968 transitions. [2021-12-17 11:54:11,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 6.730769230769231) internal successors, (700), 104 states have internal predecessors, (700), 101 states have call successors, (569), 97 states have call predecessors, (569), 96 states have return successors, (568), 100 states have call predecessors, (568), 100 states have call successors, (568) [2021-12-17 11:54:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 5968 transitions. [2021-12-17 11:54:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1920 [2021-12-17 11:54:11,343 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 11:54:11,343 INFO L514 BasicCegarLoop]: trace histogram [301, 300, 300, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:54:11,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-17 11:54:11,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:54:11,551 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 11:54:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 11:54:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash 65851854, now seen corresponding path program 7 times [2021-12-17 11:54:11,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 11:54:11,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023747256] [2021-12-17 11:54:11,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 11:54:11,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 11:54:11,578 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 11:54:11,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360885560] [2021-12-17 11:54:11,578 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 11:54:11,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 11:54:11,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 11:54:11,580 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 11:54:11,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-17 11:54:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 11:54:12,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 11:54:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 11:54:13,256 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 11:54:13,256 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 11:54:13,257 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 11:54:13,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-17 11:54:13,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-17 11:54:13,462 INFO L732 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 11:54:13,468 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 11:54:13,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 11:54:13 BoogieIcfgContainer [2021-12-17 11:54:13,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 11:54:13,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 11:54:13,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 11:54:13,804 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 11:54:13,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:52:25" (3/4) ... [2021-12-17 11:54:13,806 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 11:54:14,065 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 11:54:14,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 11:54:14,066 INFO L158 Benchmark]: Toolchain (without parser) took 108685.66ms. Allocated memory was 102.8MB in the beginning and 337.6MB in the end (delta: 234.9MB). Free memory was 73.3MB in the beginning and 129.7MB in the end (delta: -56.5MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2021-12-17 11:54:14,067 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 59.3MB in the beginning and 59.3MB in the end (delta: 41.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 11:54:14,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.80ms. Allocated memory is still 102.8MB. Free memory was 73.0MB in the beginning and 77.7MB in the end (delta: -4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 11:54:14,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.14ms. Allocated memory is still 102.8MB. Free memory was 77.7MB in the beginning and 75.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 11:54:14,068 INFO L158 Benchmark]: Boogie Preprocessor took 20.92ms. Allocated memory is still 102.8MB. Free memory was 75.9MB in the beginning and 74.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 11:54:14,068 INFO L158 Benchmark]: RCFGBuilder took 203.78ms. Allocated memory is still 102.8MB. Free memory was 74.9MB in the beginning and 65.2MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 11:54:14,068 INFO L158 Benchmark]: TraceAbstraction took 107998.57ms. Allocated memory was 102.8MB in the beginning and 337.6MB in the end (delta: 234.9MB). Free memory was 64.7MB in the beginning and 203.5MB in the end (delta: -138.7MB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. [2021-12-17 11:54:14,069 INFO L158 Benchmark]: Witness Printer took 262.22ms. Allocated memory is still 337.6MB. Free memory was 203.5MB in the beginning and 129.7MB in the end (delta: 73.7MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2021-12-17 11:54:14,072 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.19ms. Allocated memory is still 102.8MB. Free memory was 59.3MB in the beginning and 59.3MB in the end (delta: 41.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.80ms. Allocated memory is still 102.8MB. Free memory was 73.0MB in the beginning and 77.7MB in the end (delta: -4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.14ms. Allocated memory is still 102.8MB. Free memory was 77.7MB in the beginning and 75.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.92ms. Allocated memory is still 102.8MB. Free memory was 75.9MB in the beginning and 74.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 203.78ms. Allocated memory is still 102.8MB. Free memory was 74.9MB in the beginning and 65.2MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 107998.57ms. Allocated memory was 102.8MB in the beginning and 337.6MB in the end (delta: 234.9MB). Free memory was 64.7MB in the beginning and 203.5MB in the end (delta: -138.7MB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. * Witness Printer took 262.22ms. Allocated memory is still 337.6MB. Free memory was 203.5MB in the beginning and 129.7MB in the end (delta: 73.7MB). Peak memory consumption was 71.3MB. 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=203, 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=203, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=203, b=2, counter=0, p=1, q=0, r=0, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=203, b=2, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, 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=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, 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=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=201, b=2, counter=1, p=1, q=0, r=-1, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=201, b=2, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, 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=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, 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=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=199, b=2, counter=2, p=1, q=0, r=-2, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=199, b=2, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, 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=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, 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=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=197, b=2, counter=3, p=1, q=0, r=-3, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=197, b=2, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, 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=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, 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=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=195, b=2, counter=4, p=1, q=0, r=-4, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=195, b=2, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, 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=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, 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=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=193, b=2, counter=5, p=1, q=0, r=-5, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=193, b=2, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, 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=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, 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=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=191, b=2, counter=6, p=1, q=0, r=-6, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=191, b=2, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, 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=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, 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=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=189, b=2, counter=7, p=1, q=0, r=-7, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=189, b=2, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, 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=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, 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=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=187, b=2, counter=8, p=1, q=0, r=-8, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=187, b=2, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, 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=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, 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=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=185, b=2, counter=9, p=1, q=0, r=-9, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=185, b=2, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, 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=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, 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=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=183, b=2, counter=10, p=1, q=0, r=-10, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=183, b=2, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, 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=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, 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=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=181, b=2, counter=11, p=1, q=0, r=-11, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=181, b=2, counter=12, counter++=11, p=1, q=0, r=-11, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, 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=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, 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=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=179, b=2, counter=12, p=1, q=0, r=-12, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=179, b=2, counter=13, counter++=12, p=1, q=0, r=-12, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, 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=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, 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=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=177, b=2, counter=13, p=1, q=0, r=-13, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=177, b=2, counter=14, counter++=13, p=1, q=0, r=-13, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, 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=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, 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=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=175, b=2, counter=14, p=1, q=0, r=-14, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=175, b=2, counter=15, counter++=14, p=1, q=0, r=-14, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, 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=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, 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=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=173, b=2, counter=15, p=1, q=0, r=-15, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=173, b=2, counter=16, counter++=15, p=1, q=0, r=-15, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, 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=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, 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=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=171, b=2, counter=16, p=1, q=0, r=-16, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=171, b=2, counter=17, counter++=16, p=1, q=0, r=-16, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, 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=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, 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=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=169, b=2, counter=17, p=1, q=0, r=-17, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=169, b=2, counter=18, counter++=17, p=1, q=0, r=-17, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, 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=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, 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=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=167, b=2, counter=18, p=1, q=0, r=-18, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=167, b=2, counter=19, counter++=18, p=1, q=0, r=-18, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, 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=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, 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=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=165, b=2, counter=19, p=1, q=0, r=-19, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=165, b=2, counter=20, counter++=19, p=1, q=0, r=-19, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, 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=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, 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=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=163, b=2, counter=20, p=1, q=0, r=-20, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=163, b=2, counter=21, counter++=20, p=1, q=0, r=-20, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, 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=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, 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=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=161, b=2, counter=21, p=1, q=0, r=-21, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=161, b=2, counter=22, counter++=21, p=1, q=0, r=-21, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, 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=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, 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=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=159, b=2, counter=22, p=1, q=0, r=-22, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=159, b=2, counter=23, counter++=22, p=1, q=0, r=-22, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, 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=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, 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=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=157, b=2, counter=23, p=1, q=0, r=-23, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=157, b=2, counter=24, counter++=23, p=1, q=0, r=-23, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, 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=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, 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=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=155, b=2, counter=24, p=1, q=0, r=-24, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=155, b=2, counter=25, counter++=24, p=1, q=0, r=-24, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, 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=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, 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=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=153, b=2, counter=25, p=1, q=0, r=-25, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=153, b=2, counter=26, counter++=25, p=1, q=0, r=-25, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, 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=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, 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=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=151, b=2, counter=26, p=1, q=0, r=-26, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=151, b=2, counter=27, counter++=26, p=1, q=0, r=-26, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, 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=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, 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=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=149, b=2, counter=27, p=1, q=0, r=-27, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=149, b=2, counter=28, counter++=27, p=1, q=0, r=-27, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, 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=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, 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=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=147, b=2, counter=28, p=1, q=0, r=-28, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=147, b=2, counter=29, counter++=28, p=1, q=0, r=-28, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, 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=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, 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=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=145, b=2, counter=29, p=1, q=0, r=-29, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=145, b=2, counter=30, counter++=29, p=1, q=0, r=-29, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, 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=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, 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=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=143, b=2, counter=30, p=1, q=0, r=-30, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=143, b=2, counter=31, counter++=30, p=1, q=0, r=-30, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, 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=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, 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=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=141, b=2, counter=31, p=1, q=0, r=-31, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=141, b=2, counter=32, counter++=31, p=1, q=0, r=-31, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, 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=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, 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=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=139, b=2, counter=32, p=1, q=0, r=-32, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=139, b=2, counter=33, counter++=32, p=1, q=0, r=-32, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, 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=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, 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=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=137, b=2, counter=33, p=1, q=0, r=-33, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=137, b=2, counter=34, counter++=33, p=1, q=0, r=-33, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, 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=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, 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=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=135, b=2, counter=34, p=1, q=0, r=-34, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=135, b=2, counter=35, counter++=34, p=1, q=0, r=-34, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, 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=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, 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=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=133, b=2, counter=35, p=1, q=0, r=-35, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=133, b=2, counter=36, counter++=35, p=1, q=0, r=-35, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, 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=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, 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=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=131, b=2, counter=36, p=1, q=0, r=-36, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=131, b=2, counter=37, counter++=36, p=1, q=0, r=-36, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, 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=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, 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=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=129, b=2, counter=37, p=1, q=0, r=-37, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=129, b=2, counter=38, counter++=37, p=1, q=0, r=-37, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, 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=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, 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=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=127, b=2, counter=38, p=1, q=0, r=-38, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=127, b=2, counter=39, counter++=38, p=1, q=0, r=-38, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, 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=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, 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=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=125, b=2, counter=39, p=1, q=0, r=-39, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=125, b=2, counter=40, counter++=39, p=1, q=0, r=-39, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, 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=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, 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=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=123, b=2, counter=40, p=1, q=0, r=-40, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=123, b=2, counter=41, counter++=40, p=1, q=0, r=-40, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, 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=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, 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=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=121, b=2, counter=41, p=1, q=0, r=-41, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=121, b=2, counter=42, counter++=41, p=1, q=0, r=-41, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, 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=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, 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=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=119, b=2, counter=42, p=1, q=0, r=-42, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=119, b=2, counter=43, counter++=42, p=1, q=0, r=-42, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, 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=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, 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=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=117, b=2, counter=43, p=1, q=0, r=-43, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=117, b=2, counter=44, counter++=43, p=1, q=0, r=-43, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, 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=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, 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=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=115, b=2, counter=44, p=1, q=0, r=-44, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=115, b=2, counter=45, counter++=44, p=1, q=0, r=-44, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, 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=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, 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=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=113, b=2, counter=45, p=1, q=0, r=-45, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=113, b=2, counter=46, counter++=45, p=1, q=0, r=-45, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, 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=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, 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=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=111, b=2, counter=46, p=1, q=0, r=-46, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=111, b=2, counter=47, counter++=46, p=1, q=0, r=-46, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, 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=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, 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=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=109, b=2, counter=47, p=1, q=0, r=-47, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=109, b=2, counter=48, counter++=47, p=1, q=0, r=-47, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, 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=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, 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=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=107, b=2, counter=48, p=1, q=0, r=-48, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=107, b=2, counter=49, counter++=48, p=1, q=0, r=-48, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, 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=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, 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=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=105, b=2, counter=49, p=1, q=0, r=-49, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=105, b=2, counter=50, counter++=49, p=1, q=0, r=-49, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [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=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, 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=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, 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=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=103, b=2, counter=50, p=1, q=0, r=-50, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=103, b=2, counter=51, counter++=50, p=1, q=0, r=-50, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, 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=51, p=1, q=0, r=-51, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=101, b=2, counter=52, counter++=51, p=1, q=0, r=-51, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, 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=52, p=1, q=0, r=-52, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=99, b=2, counter=53, counter++=52, p=1, q=0, r=-52, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, 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=53, p=1, q=0, r=-53, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=97, b=2, counter=54, counter++=53, p=1, q=0, r=-53, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, 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=54, p=1, q=0, r=-54, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=95, b=2, counter=55, counter++=54, p=1, q=0, r=-54, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, 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=55, p=1, q=0, r=-55, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=93, b=2, counter=56, counter++=55, p=1, q=0, r=-55, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, 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=56, p=1, q=0, r=-56, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=91, b=2, counter=57, counter++=56, p=1, q=0, r=-56, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, 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=57, p=1, q=0, r=-57, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=89, b=2, counter=58, counter++=57, p=1, q=0, r=-57, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, 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=58, p=1, q=0, r=-58, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=87, b=2, counter=59, counter++=58, p=1, q=0, r=-58, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, 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=59, p=1, q=0, r=-59, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=85, b=2, counter=60, counter++=59, p=1, q=0, r=-59, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, 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=60, p=1, q=0, r=-60, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=83, b=2, counter=61, counter++=60, p=1, q=0, r=-60, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, 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=61, p=1, q=0, r=-61, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=81, b=2, counter=62, counter++=61, p=1, q=0, r=-61, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, 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=62, p=1, q=0, r=-62, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=79, b=2, counter=63, counter++=62, p=1, q=0, r=-62, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, 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=63, p=1, q=0, r=-63, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=77, b=2, counter=64, counter++=63, p=1, q=0, r=-63, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, 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=64, p=1, q=0, r=-64, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=75, b=2, counter=65, counter++=64, p=1, q=0, r=-64, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, 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=65, p=1, q=0, r=-65, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=73, b=2, counter=66, counter++=65, p=1, q=0, r=-65, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, 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=66, p=1, q=0, r=-66, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=71, b=2, counter=67, counter++=66, p=1, q=0, r=-66, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, 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=67, p=1, q=0, r=-67, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=69, b=2, counter=68, counter++=67, p=1, q=0, r=-67, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, 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=68, p=1, q=0, r=-68, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=67, b=2, counter=69, counter++=68, p=1, q=0, r=-68, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, 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=69, p=1, q=0, r=-69, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=65, b=2, counter=70, counter++=69, p=1, q=0, r=-69, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, 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=70, p=1, q=0, r=-70, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=63, b=2, counter=71, counter++=70, p=1, q=0, r=-70, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, 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=71, p=1, q=0, r=-71, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=61, b=2, counter=72, counter++=71, p=1, q=0, r=-71, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, 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=72, p=1, q=0, r=-72, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=59, b=2, counter=73, counter++=72, p=1, q=0, r=-72, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, 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=73, p=1, q=0, r=-73, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=57, b=2, counter=74, counter++=73, p=1, q=0, r=-73, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, 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=74, p=1, q=0, r=-74, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=55, b=2, counter=75, counter++=74, p=1, q=0, r=-74, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, 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=75, p=1, q=0, r=-75, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=53, b=2, counter=76, counter++=75, p=1, q=0, r=-75, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, 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=76, p=1, q=0, r=-76, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=51, b=2, counter=77, counter++=76, p=1, q=0, r=-76, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, 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=77, p=1, q=0, r=-77, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=49, b=2, counter=78, counter++=77, p=1, q=0, r=-77, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, 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=78, p=1, q=0, r=-78, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=47, b=2, counter=79, counter++=78, p=1, q=0, r=-78, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, 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=79, p=1, q=0, r=-79, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=45, b=2, counter=80, counter++=79, p=1, q=0, r=-79, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, 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=80, p=1, q=0, r=-80, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=43, b=2, counter=81, counter++=80, p=1, q=0, r=-80, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, 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=81, p=1, q=0, r=-81, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=41, b=2, counter=82, counter++=81, p=1, q=0, r=-81, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, 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=82, p=1, q=0, r=-82, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=39, b=2, counter=83, counter++=82, p=1, q=0, r=-82, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, 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=83, p=1, q=0, r=-83, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=37, b=2, counter=84, counter++=83, p=1, q=0, r=-83, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, 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=84, p=1, q=0, r=-84, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=35, b=2, counter=85, counter++=84, p=1, q=0, r=-84, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, 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=85, p=1, q=0, r=-85, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=33, b=2, counter=86, counter++=85, p=1, q=0, r=-85, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, 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=86, p=1, q=0, r=-86, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=31, b=2, counter=87, counter++=86, p=1, q=0, r=-86, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, 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=87, p=1, q=0, r=-87, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=29, b=2, counter=88, counter++=87, p=1, q=0, r=-87, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, 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=88, p=1, q=0, r=-88, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=27, b=2, counter=89, counter++=88, p=1, q=0, r=-88, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, 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=89, p=1, q=0, r=-89, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=25, b=2, counter=90, counter++=89, p=1, q=0, r=-89, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, 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=90, p=1, q=0, r=-90, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=23, b=2, counter=91, counter++=90, p=1, q=0, r=-90, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, 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=91, p=1, q=0, r=-91, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=21, b=2, counter=92, counter++=91, p=1, q=0, r=-91, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, 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=92, p=1, q=0, r=-92, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=19, b=2, counter=93, counter++=92, p=1, q=0, r=-92, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, 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=93, p=1, q=0, r=-93, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=17, b=2, counter=94, counter++=93, p=1, q=0, r=-93, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, 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=94, p=1, q=0, r=-94, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=15, b=2, counter=95, counter++=94, p=1, q=0, r=-94, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, 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=95, p=1, q=0, r=-95, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=13, b=2, counter=96, counter++=95, p=1, q=0, r=-95, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, 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=96, p=1, q=0, r=-96, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=11, b=2, counter=97, counter++=96, p=1, q=0, r=-96, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, 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=97, p=1, q=0, r=-97, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=9, b=2, counter=98, counter++=97, p=1, q=0, r=-97, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, 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=98, p=1, q=0, r=-98, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=7, b=2, counter=99, counter++=98, p=1, q=0, r=-98, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, 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=99, p=1, q=0, r=-99, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=5, b=2, counter=100, counter++=99, p=1, q=0, r=-99, s=1, x=203, y=2] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, 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=100, p=1, q=0, r=-100, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=3, b=2, counter=101, counter++=100, p=1, q=0, r=-100, s=1, x=203, y=2] [L34] COND FALSE !(counter++<100) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=101] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 107.6s, OverallIterations: 17, TraceHistogramMax: 301, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.2s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4090 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4049 mSDsluCounter, 5366 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4028 mSDsCounter, 2641 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4933 IncrementalHoareTripleChecker+Invalid, 7574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2641 mSolverCounterUnsat, 1338 mSDtfsCounter, 4933 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7655 GetRequests, 7029 SyntacticMatches, 8 SemanticMatches, 618 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12183 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5273occurred in iteration=16, InterpolantAutomatonStates: 626, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 68.4s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 5718 NumberOfCodeBlocks, 5698 NumberOfCodeBlocksAsserted, 306 NumberOfCheckSat, 7391 ConstructedInterpolants, 0 QuantifiedInterpolants, 18043 SizeOfPredicates, 195 NumberOfNonLiveVariables, 8357 ConjunctsInSsa, 487 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 211560/496703 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! [2021-12-17 11:54:14,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE