./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 574ddb4e 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-?-574ddb4 [2023-02-18 17:11:49,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 17:11:49,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 17:11:49,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 17:11:49,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 17:11:49,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 17:11:49,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 17:11:49,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 17:11:49,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 17:11:49,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 17:11:49,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 17:11:49,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 17:11:49,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 17:11:49,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 17:11:49,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 17:11:49,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 17:11:49,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 17:11:49,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 17:11:49,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 17:11:49,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 17:11:49,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 17:11:49,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 17:11:49,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 17:11:49,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 17:11:49,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 17:11:49,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 17:11:49,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 17:11:49,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 17:11:49,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 17:11:49,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 17:11:49,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 17:11:49,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 17:11:49,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 17:11:49,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 17:11:49,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 17:11:49,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 17:11:49,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 17:11:49,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 17:11:49,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 17:11:49,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 17:11:49,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 17:11:49,855 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 17:11:49,884 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 17:11:49,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 17:11:49,885 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 17:11:49,885 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 17:11:49,885 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 17:11:49,885 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 17:11:49,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 17:11:49,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 17:11:49,886 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 17:11:49,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 17:11:49,887 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 17:11:49,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 17:11:49,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 17:11:49,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 17:11:49,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 17:11:49,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 17:11:49,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 17:11:49,888 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 17:11:49,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 17:11:49,888 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 17:11:49,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 17:11:49,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 17:11:49,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 17:11:49,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 17:11:49,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 17:11:49,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 17:11:49,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 17:11:49,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 17:11:49,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 17:11:49,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 17:11:49,890 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 17:11:49,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 17:11:49,890 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 17:11:49,890 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 17:11:49,890 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 17:11:49,890 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 [2023-02-18 17:11:50,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 17:11:50,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 17:11:50,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 17:11:50,115 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 17:11:50,115 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 17:11:50,116 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 [2023-02-18 17:11:50,988 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 17:11:51,191 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 17:11:51,192 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c [2023-02-18 17:11:51,195 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe70f5a7a/6c9a094689ea4e0595904b0571fc33c9/FLAGbd07b191e [2023-02-18 17:11:51,621 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe70f5a7a/6c9a094689ea4e0595904b0571fc33c9 [2023-02-18 17:11:51,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 17:11:51,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 17:11:51,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 17:11:51,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 17:11:51,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 17:11:51,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a23e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51, skipping insertion in model container [2023-02-18 17:11:51,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 17:11:51,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 17:11:51,720 WARN L237 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] [2023-02-18 17:11:51,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 17:11:51,736 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 17:11:51,743 WARN L237 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] [2023-02-18 17:11:51,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 17:11:51,771 INFO L208 MainTranslator]: Completed translation [2023-02-18 17:11:51,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51 WrapperNode [2023-02-18 17:11:51,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 17:11:51,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 17:11:51,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 17:11:51,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 17:11:51,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,795 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2023-02-18 17:11:51,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 17:11:51,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 17:11:51,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 17:11:51,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 17:11:51,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,822 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 17:11:51,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 17:11:51,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 17:11:51,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 17:11:51,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (1/1) ... [2023-02-18 17:11:51,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 17:11:51,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:51,847 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) [2023-02-18 17:11:51,866 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 [2023-02-18 17:11:51,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 17:11:51,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 17:11:51,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 17:11:51,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 17:11:51,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 17:11:51,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 17:11:51,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 17:11:51,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 17:11:51,949 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 17:11:51,951 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 17:11:52,095 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 17:11:52,099 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 17:11:52,108 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 17:11:52,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:11:52 BoogieIcfgContainer [2023-02-18 17:11:52,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 17:11:52,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 17:11:52,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 17:11:52,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 17:11:52,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 05:11:51" (1/3) ... [2023-02-18 17:11:52,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b5bbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:11:52, skipping insertion in model container [2023-02-18 17:11:52,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:11:51" (2/3) ... [2023-02-18 17:11:52,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b5bbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:11:52, skipping insertion in model container [2023-02-18 17:11:52,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:11:52" (3/3) ... [2023-02-18 17:11:52,136 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound100.c [2023-02-18 17:11:52,147 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 17:11:52,159 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 17:11:52,201 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 17:11:52,206 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c135d8f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 17:11:52,207 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 17:11:52,209 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) [2023-02-18 17:11:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 17:11:52,214 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:52,215 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:52,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2023-02-18 17:11:52,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:52,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308030655] [2023-02-18 17:11:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:52,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:52,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 17:11:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 17:11:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 17:11:52,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308030655] [2023-02-18 17:11:52,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308030655] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:11:52,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:11:52,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 17:11:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802593329] [2023-02-18 17:11:52,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:11:52,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 17:11:52,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:52,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 17:11:52,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 17:11:52,424 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) [2023-02-18 17:11:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:52,441 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2023-02-18 17:11:52,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 17:11:52,443 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 [2023-02-18 17:11:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:52,447 INFO L225 Difference]: With dead ends: 57 [2023-02-18 17:11:52,447 INFO L226 Difference]: Without dead ends: 26 [2023-02-18 17:11:52,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 17:11:52,455 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:52,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 17:11:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-18 17:11:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-18 17:11:52,485 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) [2023-02-18 17:11:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-02-18 17:11:52,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2023-02-18 17:11:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:52,489 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-18 17:11:52,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 17:11:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-02-18 17:11:52,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 17:11:52,491 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:52,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:52,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 17:11:52,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:52,494 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2023-02-18 17:11:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:52,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488886305] [2023-02-18 17:11:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:52,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 17:11:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 17:11:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 17:11:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:52,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488886305] [2023-02-18 17:11:52,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488886305] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:11:52,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:11:52,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 17:11:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54678370] [2023-02-18 17:11:52,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:11:52,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 17:11:52,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 17:11:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 17:11:52,658 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) [2023-02-18 17:11:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:52,681 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-02-18 17:11:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 17:11:52,683 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 [2023-02-18 17:11:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:52,684 INFO L225 Difference]: With dead ends: 38 [2023-02-18 17:11:52,684 INFO L226 Difference]: Without dead ends: 28 [2023-02-18 17:11:52,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 17:11:52,685 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:52,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 17:11:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-18 17:11:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-18 17:11:52,692 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) [2023-02-18 17:11:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-02-18 17:11:52,693 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2023-02-18 17:11:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:52,694 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-02-18 17:11:52,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 17:11:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-02-18 17:11:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 17:11:52,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:52,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:52,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 17:11:52,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:52,695 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2023-02-18 17:11:52,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:52,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191063793] [2023-02-18 17:11:52,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:52,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:52,703 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:52,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756691242] [2023-02-18 17:11:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:52,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:52,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:52,723 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) [2023-02-18 17:11:52,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 17:11:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:52,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 17:11:52,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 17:11:52,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 17:11:52,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:52,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191063793] [2023-02-18 17:11:52,826 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:52,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756691242] [2023-02-18 17:11:52,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756691242] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:11:52,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:11:52,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 17:11:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703795590] [2023-02-18 17:11:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:11:52,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 17:11:52,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:52,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 17:11:52,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 17:11:52,828 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 17:11:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:52,892 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2023-02-18 17:11:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 17:11:52,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-02-18 17:11:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:52,894 INFO L225 Difference]: With dead ends: 45 [2023-02-18 17:11:52,894 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 17:11:52,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-18 17:11:52,895 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:52,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 156 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 17:11:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 17:11:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-02-18 17:11:52,915 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) [2023-02-18 17:11:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2023-02-18 17:11:52,916 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2023-02-18 17:11:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:52,917 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-02-18 17:11:52,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 17:11:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2023-02-18 17:11:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 17:11:52,917 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:52,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:52,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 17:11:53,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:53,122 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:53,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2023-02-18 17:11:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:53,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44377088] [2023-02-18 17:11:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:53,130 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:53,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637666777] [2023-02-18 17:11:53,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:53,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:53,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:53,131 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) [2023-02-18 17:11:53,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 17:11:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:53,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 17:11:53,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 17:11:53,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:11:53,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:53,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44377088] [2023-02-18 17:11:53,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:53,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637666777] [2023-02-18 17:11:53,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637666777] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 17:11:53,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:11:53,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 17:11:53,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879999112] [2023-02-18 17:11:53,386 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 17:11:53,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 17:11:53,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:53,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 17:11:53,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:11:53,387 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 17:11:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:53,566 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2023-02-18 17:11:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 17:11:53,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-02-18 17:11:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:53,571 INFO L225 Difference]: With dead ends: 49 [2023-02-18 17:11:53,571 INFO L226 Difference]: Without dead ends: 47 [2023-02-18 17:11:53,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-18 17:11:53,575 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:53,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 84 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:11:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-18 17:11:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-02-18 17:11:53,591 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) [2023-02-18 17:11:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2023-02-18 17:11:53,594 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2023-02-18 17:11:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:53,595 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2023-02-18 17:11:53,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 17:11:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2023-02-18 17:11:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 17:11:53,596 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:53,596 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:53,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 17:11:53,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-18 17:11:53,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:53,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2023-02-18 17:11:53,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:53,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008648127] [2023-02-18 17:11:53,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:53,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:53,812 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:53,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154448016] [2023-02-18 17:11:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:53,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:53,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:53,814 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) [2023-02-18 17:11:53,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 17:11:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:53,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 17:11:53,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 17:11:53,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:11:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 17:11:53,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:53,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008648127] [2023-02-18 17:11:53,948 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:53,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154448016] [2023-02-18 17:11:53,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154448016] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 17:11:53,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:11:53,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2023-02-18 17:11:53,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602370237] [2023-02-18 17:11:53,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:11:53,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 17:11:53,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:53,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 17:11:53,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-18 17:11:53,949 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 17:11:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:53,991 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2023-02-18 17:11:53,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 17:11:53,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-02-18 17:11:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:53,993 INFO L225 Difference]: With dead ends: 71 [2023-02-18 17:11:53,994 INFO L226 Difference]: Without dead ends: 67 [2023-02-18 17:11:53,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:11:53,994 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:53,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 111 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 17:11:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-18 17:11:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-18 17:11:54,024 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) [2023-02-18 17:11:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2023-02-18 17:11:54,025 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2023-02-18 17:11:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:54,025 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2023-02-18 17:11:54,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 17:11:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2023-02-18 17:11:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-18 17:11:54,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:54,026 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:54,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 17:11:54,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:54,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:54,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2023-02-18 17:11:54,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:54,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990116531] [2023-02-18 17:11:54,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:54,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:54,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:54,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1238048376] [2023-02-18 17:11:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:54,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:54,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:54,255 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) [2023-02-18 17:11:54,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 17:11:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:54,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 17:11:54,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 17:11:54,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 17:11:54,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:54,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990116531] [2023-02-18 17:11:54,324 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:54,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238048376] [2023-02-18 17:11:54,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238048376] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:11:54,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:11:54,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 17:11:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100145952] [2023-02-18 17:11:54,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:11:54,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 17:11:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 17:11:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 17:11:54,327 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) [2023-02-18 17:11:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:54,360 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2023-02-18 17:11:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 17:11:54,361 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 [2023-02-18 17:11:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:54,363 INFO L225 Difference]: With dead ends: 83 [2023-02-18 17:11:54,363 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 17:11:54,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 17:11:54,366 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:54,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 128 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 17:11:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 17:11:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2023-02-18 17:11:54,389 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) [2023-02-18 17:11:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2023-02-18 17:11:54,391 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2023-02-18 17:11:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:54,392 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2023-02-18 17:11:54,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-18 17:11:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2023-02-18 17:11:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 17:11:54,394 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:54,394 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:54,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 17:11:54,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:54,599 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:54,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2023-02-18 17:11:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:54,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65817657] [2023-02-18 17:11:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:54,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:54,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:54,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995684403] [2023-02-18 17:11:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:54,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:54,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:54,614 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) [2023-02-18 17:11:54,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 17:11:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:54,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 17:11:54,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 17:11:54,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:11:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 17:11:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:54,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65817657] [2023-02-18 17:11:54,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:54,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995684403] [2023-02-18 17:11:54,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995684403] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:11:54,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:11:54,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-18 17:11:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284792204] [2023-02-18 17:11:54,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:11:54,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 17:11:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:54,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 17:11:54,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-18 17:11:54,682 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) [2023-02-18 17:11:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:54,761 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2023-02-18 17:11:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 17:11:54,762 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 [2023-02-18 17:11:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:54,764 INFO L225 Difference]: With dead ends: 218 [2023-02-18 17:11:54,764 INFO L226 Difference]: Without dead ends: 196 [2023-02-18 17:11:54,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-18 17:11:54,766 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 49 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:54,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 159 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 17:11:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-18 17:11:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2023-02-18 17:11:54,790 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) [2023-02-18 17:11:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2023-02-18 17:11:54,792 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2023-02-18 17:11:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:54,792 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2023-02-18 17:11:54,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 17:11:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2023-02-18 17:11:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 17:11:54,795 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:54,795 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:54,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 17:11:54,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:55,000 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2023-02-18 17:11:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:55,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675900108] [2023-02-18 17:11:55,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:55,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:55,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553779578] [2023-02-18 17:11:55,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:55,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:55,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:55,008 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) [2023-02-18 17:11:55,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 17:11:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:55,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 17:11:55,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 17:11:55,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:11:55,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:55,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675900108] [2023-02-18 17:11:55,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:55,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553779578] [2023-02-18 17:11:55,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553779578] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 17:11:55,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:11:55,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-02-18 17:11:55,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606294784] [2023-02-18 17:11:55,147 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 17:11:55,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 17:11:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 17:11:55,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-18 17:11:55,149 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 17:11:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:55,221 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2023-02-18 17:11:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 17:11:55,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-02-18 17:11:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:55,223 INFO L225 Difference]: With dead ends: 204 [2023-02-18 17:11:55,223 INFO L226 Difference]: Without dead ends: 199 [2023-02-18 17:11:55,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-18 17:11:55,226 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:55,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:11:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-18 17:11:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-02-18 17:11:55,244 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) [2023-02-18 17:11:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2023-02-18 17:11:55,245 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2023-02-18 17:11:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:55,246 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2023-02-18 17:11:55,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 17:11:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2023-02-18 17:11:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-18 17:11:55,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:55,247 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:55,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 17:11:55,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:55,452 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:55,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2023-02-18 17:11:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:55,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377576431] [2023-02-18 17:11:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:55,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:55,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112120389] [2023-02-18 17:11:55,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:55,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:55,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:55,467 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) [2023-02-18 17:11:55,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 17:11:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:55,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 17:11:55,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 17:11:55,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:11:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 17:11:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:55,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377576431] [2023-02-18 17:11:55,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:55,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112120389] [2023-02-18 17:11:55,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112120389] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:11:55,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:11:55,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-02-18 17:11:55,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852552351] [2023-02-18 17:11:55,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:11:55,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 17:11:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:55,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 17:11:55,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 17:11:55,620 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-18 17:11:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:55,740 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2023-02-18 17:11:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 17:11:55,741 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 40 [2023-02-18 17:11:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:55,745 INFO L225 Difference]: With dead ends: 228 [2023-02-18 17:11:55,745 INFO L226 Difference]: Without dead ends: 212 [2023-02-18 17:11:55,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:11:55,747 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:55,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 115 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:11:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-18 17:11:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2023-02-18 17:11:55,762 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) [2023-02-18 17:11:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2023-02-18 17:11:55,764 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2023-02-18 17:11:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:55,764 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2023-02-18 17:11:55,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-18 17:11:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2023-02-18 17:11:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 17:11:55,766 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:55,767 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:55,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 17:11:55,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:55,972 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:55,973 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2023-02-18 17:11:55,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:55,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340022426] [2023-02-18 17:11:55,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:55,983 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:55,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1238234297] [2023-02-18 17:11:55,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 17:11:55,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:55,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:55,991 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) [2023-02-18 17:11:55,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 17:11:56,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 17:11:56,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:11:56,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 17:11:56,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 17:11:56,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:11:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 17:11:56,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:56,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340022426] [2023-02-18 17:11:56,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:56,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238234297] [2023-02-18 17:11:56,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238234297] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:11:56,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:11:56,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-18 17:11:56,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189752485] [2023-02-18 17:11:56,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:11:56,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 17:11:56,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:56,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 17:11:56,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-02-18 17:11:56,122 INFO L87 Difference]: Start difference. First operand 210 states and 258 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 17:11:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:56,558 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2023-02-18 17:11:56,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 17:11:56,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 43 [2023-02-18 17:11:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:56,560 INFO L225 Difference]: With dead ends: 249 [2023-02-18 17:11:56,560 INFO L226 Difference]: Without dead ends: 225 [2023-02-18 17:11:56,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-02-18 17:11:56,561 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:56,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 147 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 17:11:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-18 17:11:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2023-02-18 17:11:56,580 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) [2023-02-18 17:11:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2023-02-18 17:11:56,581 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2023-02-18 17:11:56,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:56,582 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2023-02-18 17:11:56,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 17:11:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2023-02-18 17:11:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 17:11:56,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:56,583 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:56,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 17:11:56,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 17:11:56,788 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2023-02-18 17:11:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:56,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754011948] [2023-02-18 17:11:56,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:56,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:56,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:56,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025466330] [2023-02-18 17:11:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:56,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:56,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:56,796 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) [2023-02-18 17:11:56,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 17:11:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:11:56,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 17:11:56,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-18 17:11:56,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:11:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-18 17:11:56,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:56,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754011948] [2023-02-18 17:11:56,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:56,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025466330] [2023-02-18 17:11:56,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025466330] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:11:56,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:11:56,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-02-18 17:11:56,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244617244] [2023-02-18 17:11:56,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:11:56,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 17:11:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 17:11:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-18 17:11:56,982 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-18 17:11:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:57,415 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2023-02-18 17:11:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 17:11:57,416 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 57 [2023-02-18 17:11:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:57,417 INFO L225 Difference]: With dead ends: 218 [2023-02-18 17:11:57,417 INFO L226 Difference]: Without dead ends: 191 [2023-02-18 17:11:57,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-02-18 17:11:57,417 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 37 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:57,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 261 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 17:11:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-18 17:11:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2023-02-18 17:11:57,430 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) [2023-02-18 17:11:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2023-02-18 17:11:57,431 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2023-02-18 17:11:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:57,431 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2023-02-18 17:11:57,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-18 17:11:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2023-02-18 17:11:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-18 17:11:57,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:57,433 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:57,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 17:11:57,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:57,638 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:57,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2023-02-18 17:11:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:57,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487804690] [2023-02-18 17:11:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:57,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:57,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249449371] [2023-02-18 17:11:57,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 17:11:57,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:57,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:57,646 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) [2023-02-18 17:11:57,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 17:11:57,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 17:11:57,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:11:57,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 17:11:57,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-02-18 17:11:57,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:11:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-02-18 17:11:57,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:57,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487804690] [2023-02-18 17:11:57,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:57,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249449371] [2023-02-18 17:11:57,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249449371] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:11:57,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:11:57,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-18 17:11:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989206576] [2023-02-18 17:11:57,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:11:57,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 17:11:57,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:57,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 17:11:57,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:11:57,763 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) [2023-02-18 17:11:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:57,953 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2023-02-18 17:11:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 17:11:57,954 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 [2023-02-18 17:11:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:57,955 INFO L225 Difference]: With dead ends: 512 [2023-02-18 17:11:57,955 INFO L226 Difference]: Without dead ends: 503 [2023-02-18 17:11:57,956 INFO L412 NwaCegarLoop]: 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 [2023-02-18 17:11:57,956 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 60 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:57,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 198 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:11:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-02-18 17:11:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2023-02-18 17:11:57,988 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) [2023-02-18 17:11:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2023-02-18 17:11:57,990 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2023-02-18 17:11:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:57,990 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2023-02-18 17:11:57,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2023-02-18 17:11:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2023-02-18 17:11:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-02-18 17:11:57,992 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:57,992 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:57,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 17:11:58,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 17:11:58,197 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2023-02-18 17:11:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:58,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229268466] [2023-02-18 17:11:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:58,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:58,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190982687] [2023-02-18 17:11:58,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 17:11:58,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:58,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:58,209 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) [2023-02-18 17:11:58,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 17:11:58,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2023-02-18 17:11:58,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:11:58,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 17:11:58,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-18 17:11:58,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:11:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2023-02-18 17:11:58,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:11:58,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229268466] [2023-02-18 17:11:58,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:11:58,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190982687] [2023-02-18 17:11:58,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190982687] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:11:58,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:11:58,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-02-18 17:11:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051706766] [2023-02-18 17:11:58,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:11:58,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 17:11:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:11:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 17:11:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-02-18 17:11:58,544 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) [2023-02-18 17:11:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:11:59,006 INFO L93 Difference]: Finished difference Result 1148 states and 1345 transitions. [2023-02-18 17:11:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-18 17:11:59,006 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 [2023-02-18 17:11:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:11:59,009 INFO L225 Difference]: With dead ends: 1148 [2023-02-18 17:11:59,010 INFO L226 Difference]: Without dead ends: 1139 [2023-02-18 17:11:59,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-02-18 17:11:59,011 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 160 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 17:11:59,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 342 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 17:11:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2023-02-18 17:11:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2023-02-18 17:11:59,080 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) [2023-02-18 17:11:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1288 transitions. [2023-02-18 17:11:59,083 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1288 transitions. Word has length 209 [2023-02-18 17:11:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:11:59,083 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1288 transitions. [2023-02-18 17:11:59,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2023-02-18 17:11:59,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1288 transitions. [2023-02-18 17:11:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2023-02-18 17:11:59,089 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:11:59,089 INFO L195 NwaCegarLoop]: trace histogram [67, 66, 66, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:11:59,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 17:11:59,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-18 17:11:59,295 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:11:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:11:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash -767722162, now seen corresponding path program 4 times [2023-02-18 17:11:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:11:59,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779067313] [2023-02-18 17:11:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:11:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:11:59,307 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:11:59,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896450532] [2023-02-18 17:11:59,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 17:11:59,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:11:59,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:11:59,309 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) [2023-02-18 17:11:59,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 17:11:59,481 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 17:11:59,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:11:59,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-18 17:11:59,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:11:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-02-18 17:11:59,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2023-02-18 17:12:00,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:00,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779067313] [2023-02-18 17:12:00,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:00,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896450532] [2023-02-18 17:12:00,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896450532] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:12:00,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:12:00,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-02-18 17:12:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015932806] [2023-02-18 17:12:00,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:12:00,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-18 17:12:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:00,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-18 17:12:00,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-02-18 17:12:00,271 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) [2023-02-18 17:12:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:01,551 INFO L93 Difference]: Finished difference Result 2420 states and 2833 transitions. [2023-02-18 17:12:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-02-18 17:12:01,552 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 [2023-02-18 17:12:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:01,558 INFO L225 Difference]: With dead ends: 2420 [2023-02-18 17:12:01,558 INFO L226 Difference]: Without dead ends: 2411 [2023-02-18 17:12:01,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-02-18 17:12:01,561 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 441 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 17:12:01,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 800 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 17:12:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2023-02-18 17:12:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2411. [2023-02-18 17:12:01,750 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) [2023-02-18 17:12:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2728 transitions. [2023-02-18 17:12:01,756 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2728 transitions. Word has length 437 [2023-02-18 17:12:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:01,759 INFO L495 AbstractCegarLoop]: Abstraction has 2411 states and 2728 transitions. [2023-02-18 17:12:01,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) [2023-02-18 17:12:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2728 transitions. [2023-02-18 17:12:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2023-02-18 17:12:01,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:01,778 INFO L195 NwaCegarLoop]: trace histogram [139, 138, 138, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:12:01,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 17:12:01,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-18 17:12:01,984 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:01,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:01,985 INFO L85 PathProgramCache]: Analyzing trace with hash -776415410, now seen corresponding path program 5 times [2023-02-18 17:12:01,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:01,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472959884] [2023-02-18 17:12:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:01,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:02,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:02,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583416217] [2023-02-18 17:12:02,007 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 17:12:02,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:02,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:02,029 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) [2023-02-18 17:12:02,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 17:15:50,846 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2023-02-18 17:15:50,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:15:50,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-18 17:15:50,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:15:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 44597 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-02-18 17:15:51,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:15:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2023-02-18 17:15:53,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:15:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472959884] [2023-02-18 17:15:53,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:15:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583416217] [2023-02-18 17:15:53,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583416217] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:15:53,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:15:53,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2023-02-18 17:15:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722781250] [2023-02-18 17:15:53,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:15:53,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-02-18 17:15:53,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:15:53,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-02-18 17:15:53,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2023-02-18 17:15:53,187 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) [2023-02-18 17:15:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:15:57,898 INFO L93 Difference]: Finished difference Result 4964 states and 5809 transitions. [2023-02-18 17:15:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-02-18 17:15:57,899 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 [2023-02-18 17:15:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:15:57,912 INFO L225 Difference]: With dead ends: 4964 [2023-02-18 17:15:57,913 INFO L226 Difference]: Without dead ends: 4955 [2023-02-18 17:15:57,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1877 GetRequests, 1688 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2023-02-18 17:15:57,923 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 1032 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 1869 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:15:57,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1529 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1869 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 17:15:57,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2023-02-18 17:15:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 4955. [2023-02-18 17:15:58,279 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) [2023-02-18 17:15:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 5608 transitions. [2023-02-18 17:15:58,291 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 5608 transitions. Word has length 893 [2023-02-18 17:15:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:15:58,292 INFO L495 AbstractCegarLoop]: Abstraction has 4955 states and 5608 transitions. [2023-02-18 17:15:58,293 INFO L496 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) [2023-02-18 17:15:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 5608 transitions. [2023-02-18 17:15:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1806 [2023-02-18 17:15:58,360 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:15:58,361 INFO L195 NwaCegarLoop]: 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] [2023-02-18 17:15:58,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-18 17:15:58,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 17:15:58,577 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:15:58,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:15:58,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1655802702, now seen corresponding path program 6 times [2023-02-18 17:15:58,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:15:58,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347070228] [2023-02-18 17:15:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:15:58,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:15:58,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:15:58,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661477107] [2023-02-18 17:15:58,617 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 17:15:58,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:15:58,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:15:58,618 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) [2023-02-18 17:15:58,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-18 17:16:10,654 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 179 check-sat command(s) [2023-02-18 17:16:10,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:16:10,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 3826 conjuncts, 191 conjunts are in the unsatisfiable core [2023-02-18 17:16:10,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:16:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 188141 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2023-02-18 17:16:12,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:16:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 30785 refuted. 0 times theorem prover too weak. 158488 trivial. 0 not checked. [2023-02-18 17:16:15,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:16:15,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347070228] [2023-02-18 17:16:15,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:16:15,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661477107] [2023-02-18 17:16:15,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661477107] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:16:15,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:16:15,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2023-02-18 17:16:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259060266] [2023-02-18 17:16:15,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:16:15,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-02-18 17:16:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:16:15,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-02-18 17:16:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2023-02-18 17:16:15,866 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) [2023-02-18 17:16:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:16:20,570 INFO L93 Difference]: Finished difference Result 5282 states and 6001 transitions. [2023-02-18 17:16:20,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2023-02-18 17:16:20,571 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 [2023-02-18 17:16:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:16:20,585 INFO L225 Difference]: With dead ends: 5282 [2023-02-18 17:16:20,585 INFO L226 Difference]: Without dead ends: 5273 [2023-02-18 17:16:20,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3707 GetRequests, 3416 SyntacticMatches, 90 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9505 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2023-02-18 17:16:20,589 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 587 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-18 17:16:20,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1592 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-18 17:16:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5273 states. [2023-02-18 17:16:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5273 to 5273. [2023-02-18 17:16:20,924 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) [2023-02-18 17:16:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 5968 transitions. [2023-02-18 17:16:20,932 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 5968 transitions. Word has length 1805 [2023-02-18 17:16:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:16:20,934 INFO L495 AbstractCegarLoop]: Abstraction has 5273 states and 5968 transitions. [2023-02-18 17:16:20,935 INFO L496 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) [2023-02-18 17:16:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 5968 transitions. [2023-02-18 17:16:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1920 [2023-02-18 17:16:20,963 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:16:20,963 INFO L195 NwaCegarLoop]: 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] [2023-02-18 17:16:20,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-18 17:16:21,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:16:21,179 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:16:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:16:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash 65851854, now seen corresponding path program 7 times [2023-02-18 17:16:21,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:16:21,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81024920] [2023-02-18 17:16:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:16:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:16:21,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:16:21,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187566713] [2023-02-18 17:16:21,215 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 17:16:21,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:16:21,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:16:21,230 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) [2023-02-18 17:16:21,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-18 17:16:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 17:16:21,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 17:16:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 17:16:22,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 17:16:22,884 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 17:16:22,885 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 17:16:22,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-18 17:16:23,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-18 17:16:23,103 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:16:23,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 17:16:23,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 05:16:23 BoogieIcfgContainer [2023-02-18 17:16:23,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 17:16:23,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 17:16:23,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 17:16:23,298 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 17:16:23,298 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:11:52" (3/4) ... [2023-02-18 17:16:23,299 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 17:16:23,562 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 17:16:23,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 17:16:23,563 INFO L158 Benchmark]: Toolchain (without parser) took 271939.45ms. Allocated memory was 151.0MB in the beginning and 545.3MB in the end (delta: 394.3MB). Free memory was 117.1MB in the beginning and 400.3MB in the end (delta: -283.2MB). Peak memory consumption was 385.8MB. Max. memory is 16.1GB. [2023-02-18 17:16:23,563 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 17:16:23,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.61ms. Allocated memory is still 151.0MB. Free memory was 117.1MB in the beginning and 106.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 17:16:23,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.09ms. Allocated memory is still 151.0MB. Free memory was 106.6MB in the beginning and 104.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 17:16:23,564 INFO L158 Benchmark]: Boogie Preprocessor took 28.78ms. Allocated memory is still 151.0MB. Free memory was 104.7MB in the beginning and 103.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 17:16:23,565 INFO L158 Benchmark]: RCFGBuilder took 285.40ms. Allocated memory is still 151.0MB. Free memory was 103.6MB in the beginning and 93.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 17:16:23,565 INFO L158 Benchmark]: TraceAbstraction took 271185.32ms. Allocated memory was 151.0MB in the beginning and 545.3MB in the end (delta: 394.3MB). Free memory was 92.2MB in the beginning and 174.2MB in the end (delta: -82.0MB). Peak memory consumption was 314.0MB. Max. memory is 16.1GB. [2023-02-18 17:16:23,565 INFO L158 Benchmark]: Witness Printer took 265.00ms. Allocated memory is still 545.3MB. Free memory was 174.2MB in the beginning and 400.3MB in the end (delta: -226.1MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2023-02-18 17:16:23,569 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.13ms. Allocated memory is still 125.8MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.61ms. Allocated memory is still 151.0MB. Free memory was 117.1MB in the beginning and 106.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.09ms. Allocated memory is still 151.0MB. Free memory was 106.6MB in the beginning and 104.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.78ms. Allocated memory is still 151.0MB. Free memory was 104.7MB in the beginning and 103.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 285.40ms. Allocated memory is still 151.0MB. Free memory was 103.6MB in the beginning and 93.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 271185.32ms. Allocated memory was 151.0MB in the beginning and 545.3MB in the end (delta: 394.3MB). Free memory was 92.2MB in the beginning and 174.2MB in the end (delta: -82.0MB). Peak memory consumption was 314.0MB. Max. memory is 16.1GB. * Witness Printer took 265.00ms. Allocated memory is still 545.3MB. Free memory was 174.2MB in the beginning and 400.3MB in the end (delta: -226.1MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 270.9s, OverallIterations: 17, TraceHistogramMax: 301, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2520 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2488 mSDsluCounter, 5839 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4516 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5987 IncrementalHoareTripleChecker+Invalid, 6663 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 1323 mSDtfsCounter, 5987 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7704 GetRequests, 6951 SyntacticMatches, 100 SemanticMatches, 653 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16727 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5273occurred in iteration=16, InterpolantAutomatonStates: 636, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 241.5s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 5718 NumberOfCodeBlocks, 5698 NumberOfCodeBlocksAsserted, 306 NumberOfCheckSat, 7419 ConstructedInterpolants, 0 QuantifiedInterpolants, 27140 SizeOfPredicates, 226 NumberOfNonLiveVariables, 8357 ConjunctsInSsa, 540 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 211550/496715 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! [2023-02-18 17:16:23,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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