./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_unwindbound50.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 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 17:12:36,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 17:12:36,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 17:12:36,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 17:12:36,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 17:12:36,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 17:12:36,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 17:12:36,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 17:12:36,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 17:12:36,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 17:12:36,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 17:12:36,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 17:12:36,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 17:12:36,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 17:12:36,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 17:12:36,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 17:12:36,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 17:12:36,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 17:12:36,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 17:12:36,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 17:12:36,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 17:12:36,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 17:12:36,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 17:12:36,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 17:12:36,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 17:12:36,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 17:12:36,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 17:12:36,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 17:12:36,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 17:12:36,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 17:12:36,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 17:12:36,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 17:12:36,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 17:12:36,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 17:12:36,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 17:12:36,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 17:12:36,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 17:12:36,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 17:12:36,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 17:12:36,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 17:12:36,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 17:12:36,801 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:12:36,837 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 17:12:36,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 17:12:36,837 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 17:12:36,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 17:12:36,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 17:12:36,838 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 17:12:36,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 17:12:36,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 17:12:36,839 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 17:12:36,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 17:12:36,840 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 17:12:36,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 17:12:36,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 17:12:36,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 17:12:36,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 17:12:36,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 17:12:36,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 17:12:36,842 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 17:12:36,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 17:12:36,842 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 17:12:36,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 17:12:36,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 17:12:36,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 17:12:36,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 17:12:36,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 17:12:36,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 17:12:36,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 17:12:36,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 17:12:36,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 17:12:36,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 17:12:36,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 17:12:36,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 17:12:36,845 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 17:12:36,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 17:12:36,845 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 17:12:36,845 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 -> 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 [2023-02-18 17:12:37,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 17:12:37,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 17:12:37,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 17:12:37,078 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 17:12:37,078 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 17:12:37,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2023-02-18 17:12:38,355 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 17:12:38,523 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 17:12:38,524 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2023-02-18 17:12:38,529 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce248887/85fba6f3396e430f9cc714bc9b31ff61/FLAG31749e337 [2023-02-18 17:12:38,539 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce248887/85fba6f3396e430f9cc714bc9b31ff61 [2023-02-18 17:12:38,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 17:12:38,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 17:12:38,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 17:12:38,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 17:12:38,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 17:12:38,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@501943ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38, skipping insertion in model container [2023-02-18 17:12:38,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 17:12:38,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 17:12:38,689 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_unwindbound50.c[489,502] [2023-02-18 17:12:38,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 17:12:38,715 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 17:12:38,722 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_unwindbound50.c[489,502] [2023-02-18 17:12:38,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 17:12:38,739 INFO L208 MainTranslator]: Completed translation [2023-02-18 17:12:38,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38 WrapperNode [2023-02-18 17:12:38,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 17:12:38,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 17:12:38,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 17:12:38,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 17:12:38,746 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:12:38" (1/1) ... [2023-02-18 17:12:38,751 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:12:38" (1/1) ... [2023-02-18 17:12:38,764 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2023-02-18 17:12:38,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 17:12:38,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 17:12:38,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 17:12:38,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 17:12:38,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,779 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 17:12:38,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 17:12:38,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 17:12:38,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 17:12:38,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38" (1/1) ... [2023-02-18 17:12:38,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 17:12:38,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:38,814 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:12:38,817 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:12:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 17:12:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 17:12:38,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 17:12:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 17:12:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 17:12:38,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 17:12:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 17:12:38,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 17:12:38,887 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 17:12:38,888 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 17:12:38,987 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 17:12:38,992 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 17:12:38,992 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 17:12:38,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:12:38 BoogieIcfgContainer [2023-02-18 17:12:38,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 17:12:38,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 17:12:38,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 17:12:38,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 17:12:38,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 05:12:38" (1/3) ... [2023-02-18 17:12:38,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b449ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:12:38, skipping insertion in model container [2023-02-18 17:12:38,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:12:38" (2/3) ... [2023-02-18 17:12:38,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b449ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:12:38, skipping insertion in model container [2023-02-18 17:12:38,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:12:38" (3/3) ... [2023-02-18 17:12:39,000 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2023-02-18 17:12:39,013 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 17:12:39,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 17:12:39,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 17:12:39,050 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;@4ecbab0a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 17:12:39,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 17:12:39,053 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:12:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 17:12:39,059 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:39,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:12:39,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:39,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2023-02-18 17:12:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:39,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81798087] [2023-02-18 17:12:39,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:39,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:39,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 17:12:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:39,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 17:12:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:39,242 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:12:39,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:39,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81798087] [2023-02-18 17:12:39,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81798087] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:12:39,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:12:39,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 17:12:39,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86801552] [2023-02-18 17:12:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:12:39,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 17:12:39,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:39,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 17:12:39,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 17:12:39,284 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:12:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:39,309 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2023-02-18 17:12:39,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 17:12:39,310 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:12:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:39,316 INFO L225 Difference]: With dead ends: 57 [2023-02-18 17:12:39,316 INFO L226 Difference]: Without dead ends: 26 [2023-02-18 17:12:39,319 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:12:39,323 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:12:39,323 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:12:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-18 17:12:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-18 17:12:39,352 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:12:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-02-18 17:12:39,354 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2023-02-18 17:12:39,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:39,355 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-18 17:12:39,355 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:12:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-02-18 17:12:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 17:12:39,357 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:39,358 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:12:39,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 17:12:39,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2023-02-18 17:12:39,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:39,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684248950] [2023-02-18 17:12:39,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:39,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 17:12:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 17:12:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:39,543 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:12:39,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:39,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684248950] [2023-02-18 17:12:39,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684248950] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:12:39,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:12:39,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 17:12:39,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741381173] [2023-02-18 17:12:39,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:12:39,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 17:12:39,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:39,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 17:12:39,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 17:12:39,556 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:12:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:39,586 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-02-18 17:12:39,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 17:12:39,586 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:12:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:39,587 INFO L225 Difference]: With dead ends: 38 [2023-02-18 17:12:39,587 INFO L226 Difference]: Without dead ends: 28 [2023-02-18 17:12:39,588 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:12:39,589 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:12:39,592 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:12:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-18 17:12:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-18 17:12:39,613 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:12:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-02-18 17:12:39,614 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2023-02-18 17:12:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:39,615 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-02-18 17:12:39,616 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:12:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-02-18 17:12:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 17:12:39,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:39,617 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:12:39,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 17:12:39,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:39,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2023-02-18 17:12:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:39,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493548570] [2023-02-18 17:12:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:39,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:39,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112825276] [2023-02-18 17:12:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:39,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:39,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:39,661 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:12:39,674 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:12:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:39,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 17:12:39,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:39,821 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:12:39,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 17:12:39,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:39,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493548570] [2023-02-18 17:12:39,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:39,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112825276] [2023-02-18 17:12:39,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112825276] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:12:39,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:12:39,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 17:12:39,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947773651] [2023-02-18 17:12:39,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:12:39,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 17:12:39,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:39,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 17:12:39,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 17:12:39,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:12:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:39,929 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2023-02-18 17:12:39,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 17:12:39,930 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:12:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:39,931 INFO L225 Difference]: With dead ends: 45 [2023-02-18 17:12:39,931 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 17:12:39,931 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:12:39,932 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:12:39,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 156 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 17:12:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 17:12:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-02-18 17:12:39,941 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:12:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2023-02-18 17:12:39,943 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2023-02-18 17:12:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:39,943 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-02-18 17:12:39,943 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:12:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2023-02-18 17:12:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 17:12:39,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:39,944 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:12:39,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 17:12:40,153 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:12:40,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:40,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2023-02-18 17:12:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:40,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843798248] [2023-02-18 17:12:40,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:40,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:40,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135807105] [2023-02-18 17:12:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:40,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:40,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:40,165 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:12:40,192 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:12:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:40,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 17:12:40,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:40,390 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:12:40,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:40,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843798248] [2023-02-18 17:12:40,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:40,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135807105] [2023-02-18 17:12:40,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135807105] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 17:12:40,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:12:40,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 17:12:40,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363202476] [2023-02-18 17:12:40,495 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 17:12:40,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 17:12:40,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:40,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 17:12:40,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:12:40,497 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:12:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:40,653 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2023-02-18 17:12:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 17:12:40,653 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:12:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:40,655 INFO L225 Difference]: With dead ends: 49 [2023-02-18 17:12:40,655 INFO L226 Difference]: Without dead ends: 47 [2023-02-18 17:12:40,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-18 17:12:40,656 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:12:40,657 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:12:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-18 17:12:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-02-18 17:12:40,665 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:12:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2023-02-18 17:12:40,666 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2023-02-18 17:12:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:40,667 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2023-02-18 17:12:40,667 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:12:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2023-02-18 17:12:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 17:12:40,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:40,668 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:12:40,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 17:12:40,879 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:12:40,879 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:40,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2023-02-18 17:12:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:40,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186324055] [2023-02-18 17:12:40,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:40,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:40,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144759387] [2023-02-18 17:12:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:40,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:40,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:40,897 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:12:40,900 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:12:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:40,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 17:12:40,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:41,023 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:12:41,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:41,053 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:12:41,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:41,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186324055] [2023-02-18 17:12:41,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:41,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144759387] [2023-02-18 17:12:41,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144759387] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 17:12:41,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:12:41,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2023-02-18 17:12:41,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284884231] [2023-02-18 17:12:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:12:41,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 17:12:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 17:12:41,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-18 17:12:41,056 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:12:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:41,109 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2023-02-18 17:12:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 17:12:41,110 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:12:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:41,112 INFO L225 Difference]: With dead ends: 71 [2023-02-18 17:12:41,112 INFO L226 Difference]: Without dead ends: 67 [2023-02-18 17:12:41,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:12:41,114 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:12:41,114 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:12:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-18 17:12:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-18 17:12:41,127 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:12:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2023-02-18 17:12:41,129 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2023-02-18 17:12:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:41,129 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2023-02-18 17:12:41,129 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:12:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2023-02-18 17:12:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-18 17:12:41,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:41,130 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:12:41,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 17:12:41,336 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:12:41,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:41,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2023-02-18 17:12:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:41,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551192584] [2023-02-18 17:12:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:41,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:41,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910154646] [2023-02-18 17:12:41,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:41,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:41,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:41,351 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:12:41,352 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:12:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:41,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 17:12:41,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:41,418 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:12:41,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 17:12:41,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:41,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551192584] [2023-02-18 17:12:41,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:41,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910154646] [2023-02-18 17:12:41,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910154646] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 17:12:41,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 17:12:41,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 17:12:41,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146040330] [2023-02-18 17:12:41,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 17:12:41,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 17:12:41,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:41,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 17:12:41,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 17:12:41,422 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:12:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:41,473 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2023-02-18 17:12:41,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 17:12:41,474 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:12:41,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:41,477 INFO L225 Difference]: With dead ends: 83 [2023-02-18 17:12:41,477 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 17:12:41,478 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:12:41,479 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:12:41,480 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:12:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 17:12:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2023-02-18 17:12:41,500 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:12:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2023-02-18 17:12:41,505 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2023-02-18 17:12:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:41,507 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2023-02-18 17:12:41,507 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:12:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2023-02-18 17:12:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 17:12:41,509 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:41,509 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:12:41,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 17:12:41,715 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:12:41,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2023-02-18 17:12:41,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:41,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125706912] [2023-02-18 17:12:41,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:41,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:41,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:41,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619131620] [2023-02-18 17:12:41,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:41,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:41,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:41,731 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:12:41,734 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:12:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:41,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 17:12:41,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:41,786 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:12:41,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:41,803 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:12:41,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:41,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125706912] [2023-02-18 17:12:41,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:41,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619131620] [2023-02-18 17:12:41,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619131620] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:12:41,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:12:41,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-18 17:12:41,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847588320] [2023-02-18 17:12:41,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:12:41,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 17:12:41,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 17:12:41,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-18 17:12:41,806 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:12:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:41,904 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2023-02-18 17:12:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 17:12:41,905 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:12:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:41,907 INFO L225 Difference]: With dead ends: 218 [2023-02-18 17:12:41,907 INFO L226 Difference]: Without dead ends: 196 [2023-02-18 17:12:41,908 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:12:41,909 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 49 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-18 17:12:41,909 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.1s Time] [2023-02-18 17:12:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-18 17:12:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2023-02-18 17:12:41,934 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:12:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2023-02-18 17:12:41,936 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2023-02-18 17:12:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:41,936 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2023-02-18 17:12:41,936 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:12:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2023-02-18 17:12:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 17:12:41,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:41,937 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:12:41,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 17:12:42,143 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:12:42,143 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:42,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2023-02-18 17:12:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:42,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731182631] [2023-02-18 17:12:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:42,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:42,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:42,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285134577] [2023-02-18 17:12:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:42,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:42,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:42,154 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:12:42,162 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:12:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:42,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 17:12:42,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:42,260 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:12:42,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:42,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:42,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731182631] [2023-02-18 17:12:42,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:42,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285134577] [2023-02-18 17:12:42,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285134577] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 17:12:42,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 17:12:42,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-02-18 17:12:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253058903] [2023-02-18 17:12:42,328 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 17:12:42,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 17:12:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:42,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 17:12:42,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-18 17:12:42,330 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:12:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:42,428 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2023-02-18 17:12:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 17:12:42,428 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:12:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:42,431 INFO L225 Difference]: With dead ends: 204 [2023-02-18 17:12:42,432 INFO L226 Difference]: Without dead ends: 199 [2023-02-18 17:12:42,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-18 17:12:42,435 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:12:42,435 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:12:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-18 17:12:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-02-18 17:12:42,466 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:12:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2023-02-18 17:12:42,469 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2023-02-18 17:12:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:42,469 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2023-02-18 17:12:42,469 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:12:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2023-02-18 17:12:42,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-18 17:12:42,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:42,472 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:12:42,478 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:12:42,678 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:12:42,678 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:42,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:42,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2023-02-18 17:12:42,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:42,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892254877] [2023-02-18 17:12:42,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:42,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:42,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [618894600] [2023-02-18 17:12:42,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:42,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:42,694 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:12:42,695 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:12:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:42,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 17:12:42,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:42,781 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:12:42,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:42,856 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:12:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892254877] [2023-02-18 17:12:42,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:42,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618894600] [2023-02-18 17:12:42,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618894600] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:12:42,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:12:42,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-02-18 17:12:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263382899] [2023-02-18 17:12:42,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:12:42,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 17:12:42,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:42,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 17:12:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 17:12:42,859 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:12:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:43,004 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2023-02-18 17:12:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 17:12:43,005 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:12:43,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:43,006 INFO L225 Difference]: With dead ends: 228 [2023-02-18 17:12:43,006 INFO L226 Difference]: Without dead ends: 212 [2023-02-18 17:12:43,007 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:12:43,007 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:12:43,008 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:12:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-18 17:12:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2023-02-18 17:12:43,026 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:12:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2023-02-18 17:12:43,028 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2023-02-18 17:12:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:43,028 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2023-02-18 17:12:43,028 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:12:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2023-02-18 17:12:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 17:12:43,029 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:43,029 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:12:43,039 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:12:43,234 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:12:43,235 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2023-02-18 17:12:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:43,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155812661] [2023-02-18 17:12:43,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:43,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:43,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551659444] [2023-02-18 17:12:43,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 17:12:43,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:43,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:43,244 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:12:43,249 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:12:43,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 17:12:43,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:12:43,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 17:12:43,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:43,333 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:12:43,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:43,424 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:12:43,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:43,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155812661] [2023-02-18 17:12:43,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:43,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551659444] [2023-02-18 17:12:43,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551659444] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:12:43,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:12:43,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-18 17:12:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853293488] [2023-02-18 17:12:43,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:12:43,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 17:12:43,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:43,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 17:12:43,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-02-18 17:12:43,442 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:12:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:43,901 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2023-02-18 17:12:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 17:12:43,901 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:12:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:43,903 INFO L225 Difference]: With dead ends: 249 [2023-02-18 17:12:43,903 INFO L226 Difference]: Without dead ends: 225 [2023-02-18 17:12:43,904 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:12:43,904 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:12:43,905 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:12:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-18 17:12:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2023-02-18 17:12:43,930 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:12:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2023-02-18 17:12:43,931 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2023-02-18 17:12:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:43,931 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2023-02-18 17:12:43,931 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:12:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2023-02-18 17:12:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 17:12:43,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:43,933 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:12:43,939 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:12:44,138 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:12:44,138 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2023-02-18 17:12:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:44,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705985141] [2023-02-18 17:12:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:44,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:44,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81539141] [2023-02-18 17:12:44,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:44,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:44,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:44,147 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:12:44,149 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:12:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 17:12:44,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 17:12:44,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:44,248 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:12:44,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:44,375 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:12:44,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705985141] [2023-02-18 17:12:44,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81539141] [2023-02-18 17:12:44,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81539141] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:12:44,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:12:44,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-02-18 17:12:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151620379] [2023-02-18 17:12:44,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:12:44,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 17:12:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 17:12:44,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-18 17:12:44,378 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:12:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:44,856 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2023-02-18 17:12:44,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 17:12:44,856 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:12:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:44,858 INFO L225 Difference]: With dead ends: 218 [2023-02-18 17:12:44,858 INFO L226 Difference]: Without dead ends: 191 [2023-02-18 17:12:44,858 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:12:44,859 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:12:44,859 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:12:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-18 17:12:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2023-02-18 17:12:44,877 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:12:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2023-02-18 17:12:44,878 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2023-02-18 17:12:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:44,879 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2023-02-18 17:12:44,879 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:12:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2023-02-18 17:12:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-18 17:12:44,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:44,881 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:12:44,890 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:12:45,088 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:12:45,089 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2023-02-18 17:12:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:45,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679955985] [2023-02-18 17:12:45,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:45,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:45,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [770929739] [2023-02-18 17:12:45,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 17:12:45,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:45,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:45,099 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:12:45,102 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:12:45,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 17:12:45,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:12:45,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 17:12:45,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:45,189 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:12:45,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:45,238 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:12:45,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:45,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679955985] [2023-02-18 17:12:45,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:45,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770929739] [2023-02-18 17:12:45,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770929739] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:12:45,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:12:45,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-18 17:12:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853354404] [2023-02-18 17:12:45,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:12:45,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 17:12:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:45,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 17:12:45,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-18 17:12:45,242 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:12:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:45,443 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2023-02-18 17:12:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 17:12:45,443 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:12:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:45,446 INFO L225 Difference]: With dead ends: 512 [2023-02-18 17:12:45,446 INFO L226 Difference]: Without dead ends: 503 [2023-02-18 17:12:45,446 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:12:45,447 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:12:45,447 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:12:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-02-18 17:12:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2023-02-18 17:12:45,497 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:12:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2023-02-18 17:12:45,499 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2023-02-18 17:12:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:45,500 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2023-02-18 17:12:45,501 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:12:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2023-02-18 17:12:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-02-18 17:12:45,507 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:45,507 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:12:45,513 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:12:45,712 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:12:45,713 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:45,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2023-02-18 17:12:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:45,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471554341] [2023-02-18 17:12:45,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:45,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:45,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [926758236] [2023-02-18 17:12:45,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 17:12:45,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:45,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:45,726 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:12:45,728 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:12:45,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2023-02-18 17:12:45,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:12:45,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 17:12:45,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:45,934 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:12:45,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:46,114 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:12:46,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:46,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471554341] [2023-02-18 17:12:46,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:46,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926758236] [2023-02-18 17:12:46,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926758236] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:12:46,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:12:46,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-02-18 17:12:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249348681] [2023-02-18 17:12:46,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:12:46,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 17:12:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:46,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 17:12:46,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-02-18 17:12:46,118 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:12:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:46,696 INFO L93 Difference]: Finished difference Result 1148 states and 1345 transitions. [2023-02-18 17:12:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-18 17:12:46,697 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:12:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:46,701 INFO L225 Difference]: With dead ends: 1148 [2023-02-18 17:12:46,701 INFO L226 Difference]: Without dead ends: 1139 [2023-02-18 17:12:46,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-02-18 17:12:46,703 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.3s IncrementalHoareTripleChecker+Time [2023-02-18 17:12:46,703 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.3s Time] [2023-02-18 17:12:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2023-02-18 17:12:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2023-02-18 17:12:46,812 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:12:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1288 transitions. [2023-02-18 17:12:46,816 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1288 transitions. Word has length 209 [2023-02-18 17:12:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:46,817 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1288 transitions. [2023-02-18 17:12:46,817 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:12:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1288 transitions. [2023-02-18 17:12:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2023-02-18 17:12:46,825 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:46,825 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:12:46,832 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:12:47,031 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:12:47,032 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:47,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:47,032 INFO L85 PathProgramCache]: Analyzing trace with hash -767722162, now seen corresponding path program 4 times [2023-02-18 17:12:47,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:47,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300959917] [2023-02-18 17:12:47,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:47,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:47,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:47,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507657198] [2023-02-18 17:12:47,057 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 17:12:47,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:47,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:47,058 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:12:47,061 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:12:47,246 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 17:12:47,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:12:47,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-18 17:12:47,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:12:47,498 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:12:47,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:12:48,146 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:48,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:12:48,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300959917] [2023-02-18 17:12:48,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:12:48,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507657198] [2023-02-18 17:12:48,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507657198] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:12:48,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:12:48,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-02-18 17:12:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940027203] [2023-02-18 17:12:48,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:12:48,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-18 17:12:48,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:12:48,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-18 17:12:48,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-02-18 17:12:48,150 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:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:12:49,844 INFO L93 Difference]: Finished difference Result 2420 states and 2833 transitions. [2023-02-18 17:12:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-02-18 17:12:49,845 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:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:12:49,854 INFO L225 Difference]: With dead ends: 2420 [2023-02-18 17:12:49,855 INFO L226 Difference]: Without dead ends: 2411 [2023-02-18 17:12:49,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-02-18 17:12:49,858 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 441 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2023-02-18 17:12:49,858 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.6s Time] [2023-02-18 17:12:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2023-02-18 17:12:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2411. [2023-02-18 17:12:50,049 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:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2728 transitions. [2023-02-18 17:12:50,058 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2728 transitions. Word has length 437 [2023-02-18 17:12:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:12:50,059 INFO L495 AbstractCegarLoop]: Abstraction has 2411 states and 2728 transitions. [2023-02-18 17:12:50,059 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:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2728 transitions. [2023-02-18 17:12:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2023-02-18 17:12:50,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:12:50,095 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:50,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-18 17:12:50,302 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:50,303 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:12:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:12:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash -776415410, now seen corresponding path program 5 times [2023-02-18 17:12:50,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:12:50,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412986466] [2023-02-18 17:12:50,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:12:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:12:50,335 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:12:50,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275174233] [2023-02-18 17:12:50,336 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 17:12:50,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:12:50,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:12:50,337 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:50,339 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:00,813 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2023-02-18 17:15:00,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 17:15:00,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-18 17:15:00,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 17:15:01,815 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:01,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 17:15:02,816 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:02,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 17:15:02,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412986466] [2023-02-18 17:15:02,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 17:15:02,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275174233] [2023-02-18 17:15:02,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275174233] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 17:15:02,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 17:15:02,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2023-02-18 17:15:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6745105] [2023-02-18 17:15:02,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 17:15:02,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-18 17:15:02,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 17:15:02,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-18 17:15:02,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2023-02-18 17:15:02,823 INFO L87 Difference]: Start difference. First operand 2411 states and 2728 transitions. Second operand has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) [2023-02-18 17:15:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 17:15:04,581 INFO L93 Difference]: Finished difference Result 2632 states and 2993 transitions. [2023-02-18 17:15:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-02-18 17:15:04,582 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) Word has length 893 [2023-02-18 17:15:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 17:15:04,592 INFO L225 Difference]: With dead ends: 2632 [2023-02-18 17:15:04,592 INFO L226 Difference]: Without dead ends: 2623 [2023-02-18 17:15:04,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1833 GetRequests, 1688 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2023-02-18 17:15:04,596 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 173 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 17:15:04,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 878 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 17:15:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2023-02-18 17:15:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2623. [2023-02-18 17:15:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 1734 states have (on average 1.0876585928489042) internal successors, (1886), 1784 states have internal predecessors, (1886), 542 states have call successors, (542), 346 states have call predecessors, (542), 346 states have return successors, (540), 492 states have call predecessors, (540), 540 states have call successors, (540) [2023-02-18 17:15:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 2968 transitions. [2023-02-18 17:15:04,880 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 2968 transitions. Word has length 893 [2023-02-18 17:15:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 17:15:04,884 INFO L495 AbstractCegarLoop]: Abstraction has 2623 states and 2968 transitions. [2023-02-18 17:15:04,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) [2023-02-18 17:15:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 2968 transitions. [2023-02-18 17:15:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2023-02-18 17:15:04,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 17:15:04,924 INFO L195 NwaCegarLoop]: trace histogram [151, 150, 150, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:15:04,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-18 17:15:05,142 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:05,142 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 17:15:05,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 17:15:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1208919630, now seen corresponding path program 6 times [2023-02-18 17:15:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 17:15:05,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876302673] [2023-02-18 17:15:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 17:15:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 17:15:05,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 17:15:05,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592338863] [2023-02-18 17:15:05,176 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 17:15:05,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 17:15:05,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 17:15:05,178 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:05,181 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:48,320 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2023-02-18 17:16:48,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-18 17:16:48,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 17:16:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 17:16:48,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 17:16:48,912 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 17:16:48,912 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 17:16:48,944 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:49,133 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:49,136 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 17:16:49,140 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 17:16:49,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 05:16:49 BoogieIcfgContainer [2023-02-18 17:16:49,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 17:16:49,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 17:16:49,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 17:16:49,324 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 17:16:49,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:12:38" (3/4) ... [2023-02-18 17:16:49,326 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 17:16:49,500 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 17:16:49,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 17:16:49,501 INFO L158 Benchmark]: Toolchain (without parser) took 250958.79ms. Allocated memory was 127.9MB in the beginning and 255.9MB in the end (delta: 127.9MB). Free memory was 84.6MB in the beginning and 111.2MB in the end (delta: -26.5MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. [2023-02-18 17:16:49,501 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 70.4MB in the beginning and 70.2MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 17:16:49,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.84ms. Allocated memory is still 127.9MB. Free memory was 84.3MB in the beginning and 73.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 17:16:49,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.70ms. Allocated memory is still 127.9MB. Free memory was 73.4MB in the beginning and 72.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 17:16:49,502 INFO L158 Benchmark]: Boogie Preprocessor took 16.23ms. Allocated memory is still 127.9MB. Free memory was 72.1MB in the beginning and 70.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 17:16:49,503 INFO L158 Benchmark]: RCFGBuilder took 212.47ms. Allocated memory is still 127.9MB. Free memory was 70.8MB in the beginning and 60.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 17:16:49,503 INFO L158 Benchmark]: TraceAbstraction took 250327.93ms. Allocated memory was 127.9MB in the beginning and 255.9MB in the end (delta: 127.9MB). Free memory was 59.5MB in the beginning and 141.6MB in the end (delta: -82.1MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. [2023-02-18 17:16:49,503 INFO L158 Benchmark]: Witness Printer took 176.29ms. Allocated memory is still 255.9MB. Free memory was 141.6MB in the beginning and 111.2MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-02-18 17:16:49,508 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.16ms. Allocated memory is still 96.5MB. Free memory was 70.4MB in the beginning and 70.2MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.84ms. Allocated memory is still 127.9MB. Free memory was 84.3MB in the beginning and 73.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.70ms. Allocated memory is still 127.9MB. Free memory was 73.4MB in the beginning and 72.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.23ms. Allocated memory is still 127.9MB. Free memory was 72.1MB in the beginning and 70.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 212.47ms. Allocated memory is still 127.9MB. Free memory was 70.8MB in the beginning and 60.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 250327.93ms. Allocated memory was 127.9MB in the beginning and 255.9MB in the end (delta: 127.9MB). Free memory was 59.5MB in the beginning and 141.6MB in the end (delta: -82.1MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. * Witness Printer took 176.29ms. Allocated memory is still 255.9MB. Free memory was 141.6MB in the beginning and 111.2MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=101, 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=101, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=101, b=2, counter=0, p=1, q=0, r=0, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=101, b=2, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=101, b=2, counter=1, p=1, q=0, r=0, s=1, x=101, 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=101, b=2, counter=1, p=1, q=0, r=0, s=1, x=101, 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=101, b=2, counter=1, p=1, q=0, r=0, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=101, b=2, counter=1, p=1, q=0, r=0, s=1, x=101, 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=1, p=1, q=0, r=-1, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=99, b=2, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=99, b=2, counter=2, p=1, q=0, r=-1, s=1, x=101, 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=99, b=2, counter=2, p=1, q=0, r=-1, s=1, x=101, 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=99, b=2, counter=2, p=1, q=0, r=-1, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=99, b=2, counter=2, p=1, q=0, r=-1, s=1, x=101, 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=2, p=1, q=0, r=-2, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=97, b=2, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=97, b=2, counter=3, p=1, q=0, r=-2, s=1, x=101, 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=97, b=2, counter=3, p=1, q=0, r=-2, s=1, x=101, 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=97, b=2, counter=3, p=1, q=0, r=-2, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=97, b=2, counter=3, p=1, q=0, r=-2, s=1, x=101, 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=3, p=1, q=0, r=-3, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=95, b=2, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=95, b=2, counter=4, p=1, q=0, r=-3, s=1, x=101, 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=95, b=2, counter=4, p=1, q=0, r=-3, s=1, x=101, 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=95, b=2, counter=4, p=1, q=0, r=-3, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=95, b=2, counter=4, p=1, q=0, r=-3, s=1, x=101, 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=4, p=1, q=0, r=-4, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=93, b=2, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=93, b=2, counter=5, p=1, q=0, r=-4, s=1, x=101, 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=93, b=2, counter=5, p=1, q=0, r=-4, s=1, x=101, 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=93, b=2, counter=5, p=1, q=0, r=-4, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=93, b=2, counter=5, p=1, q=0, r=-4, s=1, x=101, 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=5, p=1, q=0, r=-5, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=91, b=2, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=91, b=2, counter=6, p=1, q=0, r=-5, s=1, x=101, 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=91, b=2, counter=6, p=1, q=0, r=-5, s=1, x=101, 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=91, b=2, counter=6, p=1, q=0, r=-5, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=91, b=2, counter=6, p=1, q=0, r=-5, s=1, x=101, 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=6, p=1, q=0, r=-6, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=89, b=2, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=89, b=2, counter=7, p=1, q=0, r=-6, s=1, x=101, 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=89, b=2, counter=7, p=1, q=0, r=-6, s=1, x=101, 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=89, b=2, counter=7, p=1, q=0, r=-6, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=89, b=2, counter=7, p=1, q=0, r=-6, s=1, x=101, 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=7, p=1, q=0, r=-7, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=87, b=2, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=87, b=2, counter=8, p=1, q=0, r=-7, s=1, x=101, 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=87, b=2, counter=8, p=1, q=0, r=-7, s=1, x=101, 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=87, b=2, counter=8, p=1, q=0, r=-7, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=87, b=2, counter=8, p=1, q=0, r=-7, s=1, x=101, 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=8, p=1, q=0, r=-8, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=85, b=2, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=85, b=2, counter=9, p=1, q=0, r=-8, s=1, x=101, 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=85, b=2, counter=9, p=1, q=0, r=-8, s=1, x=101, 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=85, b=2, counter=9, p=1, q=0, r=-8, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=85, b=2, counter=9, p=1, q=0, r=-8, s=1, x=101, 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=9, p=1, q=0, r=-9, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=83, b=2, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=83, b=2, counter=10, p=1, q=0, r=-9, s=1, x=101, 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=83, b=2, counter=10, p=1, q=0, r=-9, s=1, x=101, 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=83, b=2, counter=10, p=1, q=0, r=-9, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=83, b=2, counter=10, p=1, q=0, r=-9, s=1, x=101, 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=10, p=1, q=0, r=-10, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=81, b=2, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=81, b=2, counter=11, p=1, q=0, r=-10, s=1, x=101, 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=81, b=2, counter=11, p=1, q=0, r=-10, s=1, x=101, 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=81, b=2, counter=11, p=1, q=0, r=-10, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=81, b=2, counter=11, p=1, q=0, r=-10, s=1, x=101, 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=11, p=1, q=0, r=-11, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=79, b=2, counter=12, counter++=11, p=1, q=0, r=-11, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=79, b=2, counter=12, p=1, q=0, r=-11, s=1, x=101, 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=79, b=2, counter=12, p=1, q=0, r=-11, s=1, x=101, 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=79, b=2, counter=12, p=1, q=0, r=-11, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=79, b=2, counter=12, p=1, q=0, r=-11, s=1, x=101, 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=12, p=1, q=0, r=-12, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=77, b=2, counter=13, counter++=12, p=1, q=0, r=-12, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=77, b=2, counter=13, p=1, q=0, r=-12, s=1, x=101, 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=77, b=2, counter=13, p=1, q=0, r=-12, s=1, x=101, 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=77, b=2, counter=13, p=1, q=0, r=-12, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=77, b=2, counter=13, p=1, q=0, r=-12, s=1, x=101, 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=13, p=1, q=0, r=-13, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=75, b=2, counter=14, counter++=13, p=1, q=0, r=-13, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=75, b=2, counter=14, p=1, q=0, r=-13, s=1, x=101, 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=75, b=2, counter=14, p=1, q=0, r=-13, s=1, x=101, 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=75, b=2, counter=14, p=1, q=0, r=-13, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=75, b=2, counter=14, p=1, q=0, r=-13, s=1, x=101, 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=14, p=1, q=0, r=-14, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=73, b=2, counter=15, counter++=14, p=1, q=0, r=-14, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=73, b=2, counter=15, p=1, q=0, r=-14, s=1, x=101, 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=73, b=2, counter=15, p=1, q=0, r=-14, s=1, x=101, 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=73, b=2, counter=15, p=1, q=0, r=-14, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=73, b=2, counter=15, p=1, q=0, r=-14, s=1, x=101, 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=15, p=1, q=0, r=-15, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=71, b=2, counter=16, counter++=15, p=1, q=0, r=-15, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=71, b=2, counter=16, p=1, q=0, r=-15, s=1, x=101, 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=71, b=2, counter=16, p=1, q=0, r=-15, s=1, x=101, 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=71, b=2, counter=16, p=1, q=0, r=-15, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=71, b=2, counter=16, p=1, q=0, r=-15, s=1, x=101, 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=16, p=1, q=0, r=-16, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=69, b=2, counter=17, counter++=16, p=1, q=0, r=-16, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=69, b=2, counter=17, p=1, q=0, r=-16, s=1, x=101, 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=69, b=2, counter=17, p=1, q=0, r=-16, s=1, x=101, 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=69, b=2, counter=17, p=1, q=0, r=-16, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=69, b=2, counter=17, p=1, q=0, r=-16, s=1, x=101, 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=17, p=1, q=0, r=-17, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=67, b=2, counter=18, counter++=17, p=1, q=0, r=-17, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=67, b=2, counter=18, p=1, q=0, r=-17, s=1, x=101, 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=67, b=2, counter=18, p=1, q=0, r=-17, s=1, x=101, 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=67, b=2, counter=18, p=1, q=0, r=-17, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=67, b=2, counter=18, p=1, q=0, r=-17, s=1, x=101, 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=18, p=1, q=0, r=-18, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=65, b=2, counter=19, counter++=18, p=1, q=0, r=-18, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=65, b=2, counter=19, p=1, q=0, r=-18, s=1, x=101, 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=65, b=2, counter=19, p=1, q=0, r=-18, s=1, x=101, 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=65, b=2, counter=19, p=1, q=0, r=-18, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=65, b=2, counter=19, p=1, q=0, r=-18, s=1, x=101, 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=19, p=1, q=0, r=-19, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=63, b=2, counter=20, counter++=19, p=1, q=0, r=-19, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=63, b=2, counter=20, p=1, q=0, r=-19, s=1, x=101, 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=63, b=2, counter=20, p=1, q=0, r=-19, s=1, x=101, 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=63, b=2, counter=20, p=1, q=0, r=-19, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=63, b=2, counter=20, p=1, q=0, r=-19, s=1, x=101, 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=20, p=1, q=0, r=-20, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=61, b=2, counter=21, counter++=20, p=1, q=0, r=-20, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=61, b=2, counter=21, p=1, q=0, r=-20, s=1, x=101, 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=61, b=2, counter=21, p=1, q=0, r=-20, s=1, x=101, 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=61, b=2, counter=21, p=1, q=0, r=-20, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=61, b=2, counter=21, p=1, q=0, r=-20, s=1, x=101, 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=21, p=1, q=0, r=-21, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=59, b=2, counter=22, counter++=21, p=1, q=0, r=-21, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=59, b=2, counter=22, p=1, q=0, r=-21, s=1, x=101, 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=59, b=2, counter=22, p=1, q=0, r=-21, s=1, x=101, 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=59, b=2, counter=22, p=1, q=0, r=-21, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=59, b=2, counter=22, p=1, q=0, r=-21, s=1, x=101, 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=22, p=1, q=0, r=-22, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=57, b=2, counter=23, counter++=22, p=1, q=0, r=-22, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=57, b=2, counter=23, p=1, q=0, r=-22, s=1, x=101, 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=57, b=2, counter=23, p=1, q=0, r=-22, s=1, x=101, 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=57, b=2, counter=23, p=1, q=0, r=-22, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=57, b=2, counter=23, p=1, q=0, r=-22, s=1, x=101, 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=23, p=1, q=0, r=-23, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=55, b=2, counter=24, counter++=23, p=1, q=0, r=-23, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=55, b=2, counter=24, p=1, q=0, r=-23, s=1, x=101, 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=55, b=2, counter=24, p=1, q=0, r=-23, s=1, x=101, 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=55, b=2, counter=24, p=1, q=0, r=-23, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=55, b=2, counter=24, p=1, q=0, r=-23, s=1, x=101, 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=24, p=1, q=0, r=-24, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=53, b=2, counter=25, counter++=24, p=1, q=0, r=-24, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=53, b=2, counter=25, p=1, q=0, r=-24, s=1, x=101, 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=53, b=2, counter=25, p=1, q=0, r=-24, s=1, x=101, 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=53, b=2, counter=25, p=1, q=0, r=-24, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=53, b=2, counter=25, p=1, q=0, r=-24, s=1, x=101, 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=25, p=1, q=0, r=-25, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=51, b=2, counter=26, counter++=25, p=1, q=0, r=-25, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=2, counter=26, p=1, q=0, r=-25, s=1, x=101, 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=51, b=2, counter=26, p=1, q=0, r=-25, s=1, x=101, 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=51, b=2, counter=26, p=1, q=0, r=-25, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=2, counter=26, p=1, q=0, r=-25, s=1, x=101, 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=26, p=1, q=0, r=-26, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=49, b=2, counter=27, counter++=26, p=1, q=0, r=-26, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=2, counter=27, p=1, q=0, r=-26, s=1, x=101, 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=49, b=2, counter=27, p=1, q=0, r=-26, s=1, x=101, 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=49, b=2, counter=27, p=1, q=0, r=-26, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=2, counter=27, p=1, q=0, r=-26, s=1, x=101, 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=27, p=1, q=0, r=-27, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=47, b=2, counter=28, counter++=27, p=1, q=0, r=-27, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=2, counter=28, p=1, q=0, r=-27, s=1, x=101, 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=47, b=2, counter=28, p=1, q=0, r=-27, s=1, x=101, 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=47, b=2, counter=28, p=1, q=0, r=-27, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=2, counter=28, p=1, q=0, r=-27, s=1, x=101, 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=28, p=1, q=0, r=-28, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=45, b=2, counter=29, counter++=28, p=1, q=0, r=-28, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=2, counter=29, p=1, q=0, r=-28, s=1, x=101, 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=45, b=2, counter=29, p=1, q=0, r=-28, s=1, x=101, 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=45, b=2, counter=29, p=1, q=0, r=-28, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=2, counter=29, p=1, q=0, r=-28, s=1, x=101, 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=29, p=1, q=0, r=-29, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=43, b=2, counter=30, counter++=29, p=1, q=0, r=-29, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=2, counter=30, p=1, q=0, r=-29, s=1, x=101, 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=43, b=2, counter=30, p=1, q=0, r=-29, s=1, x=101, 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=43, b=2, counter=30, p=1, q=0, r=-29, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=2, counter=30, p=1, q=0, r=-29, s=1, x=101, 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=30, p=1, q=0, r=-30, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=41, b=2, counter=31, counter++=30, p=1, q=0, r=-30, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=2, counter=31, p=1, q=0, r=-30, s=1, x=101, 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=41, b=2, counter=31, p=1, q=0, r=-30, s=1, x=101, 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=41, b=2, counter=31, p=1, q=0, r=-30, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=2, counter=31, p=1, q=0, r=-30, s=1, x=101, 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=31, p=1, q=0, r=-31, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=39, b=2, counter=32, counter++=31, p=1, q=0, r=-31, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=2, counter=32, p=1, q=0, r=-31, s=1, x=101, 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=39, b=2, counter=32, p=1, q=0, r=-31, s=1, x=101, 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=39, b=2, counter=32, p=1, q=0, r=-31, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=2, counter=32, p=1, q=0, r=-31, s=1, x=101, 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=32, p=1, q=0, r=-32, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=37, b=2, counter=33, counter++=32, p=1, q=0, r=-32, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=2, counter=33, p=1, q=0, r=-32, s=1, x=101, 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=37, b=2, counter=33, p=1, q=0, r=-32, s=1, x=101, 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=37, b=2, counter=33, p=1, q=0, r=-32, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=2, counter=33, p=1, q=0, r=-32, s=1, x=101, 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=33, p=1, q=0, r=-33, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=35, b=2, counter=34, counter++=33, p=1, q=0, r=-33, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=2, counter=34, p=1, q=0, r=-33, s=1, x=101, 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=35, b=2, counter=34, p=1, q=0, r=-33, s=1, x=101, 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=35, b=2, counter=34, p=1, q=0, r=-33, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=2, counter=34, p=1, q=0, r=-33, s=1, x=101, 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=34, p=1, q=0, r=-34, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=33, b=2, counter=35, counter++=34, p=1, q=0, r=-34, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=2, counter=35, p=1, q=0, r=-34, s=1, x=101, 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=33, b=2, counter=35, p=1, q=0, r=-34, s=1, x=101, 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=33, b=2, counter=35, p=1, q=0, r=-34, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=2, counter=35, p=1, q=0, r=-34, s=1, x=101, 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=35, p=1, q=0, r=-35, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=31, b=2, counter=36, counter++=35, p=1, q=0, r=-35, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=2, counter=36, p=1, q=0, r=-35, s=1, x=101, 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=31, b=2, counter=36, p=1, q=0, r=-35, s=1, x=101, 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=31, b=2, counter=36, p=1, q=0, r=-35, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=2, counter=36, p=1, q=0, r=-35, s=1, x=101, 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=36, p=1, q=0, r=-36, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=29, b=2, counter=37, counter++=36, p=1, q=0, r=-36, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=2, counter=37, p=1, q=0, r=-36, s=1, x=101, 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=29, b=2, counter=37, p=1, q=0, r=-36, s=1, x=101, 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=29, b=2, counter=37, p=1, q=0, r=-36, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=2, counter=37, p=1, q=0, r=-36, s=1, x=101, 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=37, p=1, q=0, r=-37, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=27, b=2, counter=38, counter++=37, p=1, q=0, r=-37, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=2, counter=38, p=1, q=0, r=-37, s=1, x=101, 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=27, b=2, counter=38, p=1, q=0, r=-37, s=1, x=101, 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=27, b=2, counter=38, p=1, q=0, r=-37, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=2, counter=38, p=1, q=0, r=-37, s=1, x=101, 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=38, p=1, q=0, r=-38, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=25, b=2, counter=39, counter++=38, p=1, q=0, r=-38, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=2, counter=39, p=1, q=0, r=-38, s=1, x=101, 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=25, b=2, counter=39, p=1, q=0, r=-38, s=1, x=101, 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=25, b=2, counter=39, p=1, q=0, r=-38, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=2, counter=39, p=1, q=0, r=-38, s=1, x=101, 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=39, p=1, q=0, r=-39, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=23, b=2, counter=40, counter++=39, p=1, q=0, r=-39, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=2, counter=40, p=1, q=0, r=-39, s=1, x=101, 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=23, b=2, counter=40, p=1, q=0, r=-39, s=1, x=101, 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=23, b=2, counter=40, p=1, q=0, r=-39, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=2, counter=40, p=1, q=0, r=-39, s=1, x=101, 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=40, p=1, q=0, r=-40, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=21, b=2, counter=41, counter++=40, p=1, q=0, r=-40, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=2, counter=41, p=1, q=0, r=-40, s=1, x=101, 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=21, b=2, counter=41, p=1, q=0, r=-40, s=1, x=101, 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=21, b=2, counter=41, p=1, q=0, r=-40, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=2, counter=41, p=1, q=0, r=-40, s=1, x=101, 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=41, p=1, q=0, r=-41, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=19, b=2, counter=42, counter++=41, p=1, q=0, r=-41, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=2, counter=42, p=1, q=0, r=-41, s=1, x=101, 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=19, b=2, counter=42, p=1, q=0, r=-41, s=1, x=101, 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=19, b=2, counter=42, p=1, q=0, r=-41, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=2, counter=42, p=1, q=0, r=-41, s=1, x=101, 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=42, p=1, q=0, r=-42, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=17, b=2, counter=43, counter++=42, p=1, q=0, r=-42, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=2, counter=43, p=1, q=0, r=-42, s=1, x=101, 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=17, b=2, counter=43, p=1, q=0, r=-42, s=1, x=101, 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=17, b=2, counter=43, p=1, q=0, r=-42, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=2, counter=43, p=1, q=0, r=-42, s=1, x=101, 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=43, p=1, q=0, r=-43, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=15, b=2, counter=44, counter++=43, p=1, q=0, r=-43, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=2, counter=44, p=1, q=0, r=-43, s=1, x=101, 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=15, b=2, counter=44, p=1, q=0, r=-43, s=1, x=101, 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=15, b=2, counter=44, p=1, q=0, r=-43, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=2, counter=44, p=1, q=0, r=-43, s=1, x=101, 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=44, p=1, q=0, r=-44, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=13, b=2, counter=45, counter++=44, p=1, q=0, r=-44, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=2, counter=45, p=1, q=0, r=-44, s=1, x=101, 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=13, b=2, counter=45, p=1, q=0, r=-44, s=1, x=101, 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=13, b=2, counter=45, p=1, q=0, r=-44, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=2, counter=45, p=1, q=0, r=-44, s=1, x=101, 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=45, p=1, q=0, r=-45, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=11, b=2, counter=46, counter++=45, p=1, q=0, r=-45, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=2, counter=46, p=1, q=0, r=-45, s=1, x=101, 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=11, b=2, counter=46, p=1, q=0, r=-45, s=1, x=101, 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=11, b=2, counter=46, p=1, q=0, r=-45, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=2, counter=46, p=1, q=0, r=-45, s=1, x=101, 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=46, p=1, q=0, r=-46, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=9, b=2, counter=47, counter++=46, p=1, q=0, r=-46, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=2, counter=47, p=1, q=0, r=-46, s=1, x=101, 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=9, b=2, counter=47, p=1, q=0, r=-46, s=1, x=101, 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=9, b=2, counter=47, p=1, q=0, r=-46, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=2, counter=47, p=1, q=0, r=-46, s=1, x=101, 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=47, p=1, q=0, r=-47, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=7, b=2, counter=48, counter++=47, p=1, q=0, r=-47, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=2, counter=48, p=1, q=0, r=-47, s=1, x=101, 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=7, b=2, counter=48, p=1, q=0, r=-47, s=1, x=101, 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=7, b=2, counter=48, p=1, q=0, r=-47, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=2, counter=48, p=1, q=0, r=-47, s=1, x=101, 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=48, p=1, q=0, r=-48, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=5, b=2, counter=49, counter++=48, p=1, q=0, r=-48, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=2, counter=49, p=1, q=0, r=-48, s=1, x=101, 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=5, b=2, counter=49, p=1, q=0, r=-48, s=1, x=101, 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=5, b=2, counter=49, p=1, q=0, r=-48, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=2, counter=49, p=1, q=0, r=-48, s=1, x=101, 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=49, p=1, q=0, r=-49, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=3, b=2, counter=50, counter++=49, p=1, q=0, r=-49, s=1, x=101, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=2, counter=50, p=1, q=0, r=-49, s=1, x=101, 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=3, b=2, counter=50, p=1, q=0, r=-49, s=1, x=101, 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=3, b=2, counter=50, p=1, q=0, r=-49, s=1, x=101, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=2, counter=50, p=1, q=0, r=-49, s=1, x=101, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=1, b=2, counter=50, p=1, q=0, r=-50, s=1, x=101, y=2] [L34] EXPR counter++ VAL [a=1, b=2, counter=51, counter++=50, p=1, q=0, r=-50, s=1, x=101, y=2] [L34] COND FALSE !(counter++<50) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 250.1s, OverallIterations: 16, TraceHistogramMax: 151, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1074 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1042 mSDsluCounter, 3596 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2730 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3229 IncrementalHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 866 mSDtfsCounter, 3229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3953 GetRequests, 3535 SyntacticMatches, 54 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4120 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2623occurred in iteration=15, InterpolantAutomatonStates: 346, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 233.9s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2963 NumberOfCodeBlocks, 2948 NumberOfCodeBlocksAsserted, 224 NumberOfCheckSat, 3811 ConstructedInterpolants, 0 QuantifiedInterpolants, 14112 SizeOfPredicates, 132 NumberOfNonLiveVariables, 4531 ConjunctsInSsa, 349 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 50802/117041 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:49,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE