./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/gcd02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/recursive/gcd02.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 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 17:40:47,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 17:40:47,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 17:40:47,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 17:40:47,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 17:40:47,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 17:40:47,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 17:40:47,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 17:40:47,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 17:40:47,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 17:40:47,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 17:40:47,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 17:40:47,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 17:40:47,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 17:40:47,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 17:40:47,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 17:40:47,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 17:40:47,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 17:40:47,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 17:40:47,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 17:40:47,661 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 17:40:47,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 17:40:47,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 17:40:47,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 17:40:47,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 17:40:47,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 17:40:47,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 17:40:47,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 17:40:47,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 17:40:47,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 17:40:47,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 17:40:47,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 17:40:47,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 17:40:47,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 17:40:47,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 17:40:47,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 17:40:47,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 17:40:47,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 17:40:47,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 17:40:47,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 17:40:47,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 17:40:47,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 17:40:47,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 17:40:47,724 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 17:40:47,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 17:40:47,725 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 17:40:47,726 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 17:40:47,726 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 17:40:47,726 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 17:40:47,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 17:40:47,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 17:40:47,727 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 17:40:47,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 17:40:47,728 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 17:40:47,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 17:40:47,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 17:40:47,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 17:40:47,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 17:40:47,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 17:40:47,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 17:40:47,730 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 17:40:47,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 17:40:47,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 17:40:47,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 17:40:47,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 17:40:47,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 17:40:47,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 17:40:47,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:40:47,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 17:40:47,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 17:40:47,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 17:40:47,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 17:40:47,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 17:40:47,734 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 17:40:47,734 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 17:40:47,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 17:40:47,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 [2022-07-22 17:40:47,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 17:40:47,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 17:40:47,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 17:40:47,976 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 17:40:47,977 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 17:40:47,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/gcd02.c [2022-07-22 17:40:48,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f247fc381/d96f7e7123db444c9044701b95d07ad5/FLAGb559b1360 [2022-07-22 17:40:48,394 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 17:40:48,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c [2022-07-22 17:40:48,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f247fc381/d96f7e7123db444c9044701b95d07ad5/FLAGb559b1360 [2022-07-22 17:40:48,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f247fc381/d96f7e7123db444c9044701b95d07ad5 [2022-07-22 17:40:48,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 17:40:48,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 17:40:48,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 17:40:48,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 17:40:48,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 17:40:48,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:40:48" (1/1) ... [2022-07-22 17:40:48,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7480315b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:48, skipping insertion in model container [2022-07-22 17:40:48,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:40:48" (1/1) ... [2022-07-22 17:40:48,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 17:40:48,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 17:40:48,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c[623,636] [2022-07-22 17:40:48,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c[1283,1296] [2022-07-22 17:40:48,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:40:48,991 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 17:40:49,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c[623,636] [2022-07-22 17:40:49,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c[1283,1296] [2022-07-22 17:40:49,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:40:49,037 INFO L208 MainTranslator]: Completed translation [2022-07-22 17:40:49,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49 WrapperNode [2022-07-22 17:40:49,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 17:40:49,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 17:40:49,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 17:40:49,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 17:40:49,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (1/1) ... [2022-07-22 17:40:49,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (1/1) ... [2022-07-22 17:40:49,067 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2022-07-22 17:40:49,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 17:40:49,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 17:40:49,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 17:40:49,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 17:40:49,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (1/1) ... [2022-07-22 17:40:49,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (1/1) ... [2022-07-22 17:40:49,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (1/1) ... [2022-07-22 17:40:49,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (1/1) ... [2022-07-22 17:40:49,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (1/1) ... [2022-07-22 17:40:49,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (1/1) ... [2022-07-22 17:40:49,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (1/1) ... [2022-07-22 17:40:49,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 17:40:49,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 17:40:49,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 17:40:49,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 17:40:49,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (1/1) ... [2022-07-22 17:40:49,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:40:49,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:40:49,120 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) [2022-07-22 17:40:49,122 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 [2022-07-22 17:40:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 17:40:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2022-07-22 17:40:49,149 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2022-07-22 17:40:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 17:40:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2022-07-22 17:40:49,150 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2022-07-22 17:40:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 17:40:49,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 17:40:49,201 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 17:40:49,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 17:40:49,312 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 17:40:49,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 17:40:49,317 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 17:40:49,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:40:49 BoogieIcfgContainer [2022-07-22 17:40:49,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 17:40:49,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 17:40:49,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 17:40:49,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 17:40:49,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 05:40:48" (1/3) ... [2022-07-22 17:40:49,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0bc658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:40:49, skipping insertion in model container [2022-07-22 17:40:49,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:40:49" (2/3) ... [2022-07-22 17:40:49,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0bc658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:40:49, skipping insertion in model container [2022-07-22 17:40:49,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:40:49" (3/3) ... [2022-07-22 17:40:49,327 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd02.c [2022-07-22 17:40:49,347 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 17:40:49,348 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 17:40:49,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 17:40:49,429 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b30dc15, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c9a928d [2022-07-22 17:40:49,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-22 17:40:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-22 17:40:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 17:40:49,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:49,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:49,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1041004109, now seen corresponding path program 1 times [2022-07-22 17:40:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:49,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447140051] [2022-07-22 17:40:49,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:49,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:40:49,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:49,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447140051] [2022-07-22 17:40:49,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447140051] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:40:49,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:40:49,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 17:40:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059101638] [2022-07-22 17:40:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:40:49,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 17:40:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:49,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 17:40:49,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 17:40:49,711 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 17:40:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:49,815 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2022-07-22 17:40:49,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:40:49,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 17:40:49,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:49,825 INFO L225 Difference]: With dead ends: 78 [2022-07-22 17:40:49,825 INFO L226 Difference]: Without dead ends: 41 [2022-07-22 17:40:49,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:40:49,831 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 36 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:49,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 133 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:40:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-22 17:40:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-07-22 17:40:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-22 17:40:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-07-22 17:40:49,866 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2022-07-22 17:40:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:49,867 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-07-22 17:40:49,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 17:40:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-07-22 17:40:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 17:40:49,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:49,868 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:49,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 17:40:49,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:49,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1602001293, now seen corresponding path program 1 times [2022-07-22 17:40:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:49,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103959940] [2022-07-22 17:40:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:49,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:40:49,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:49,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103959940] [2022-07-22 17:40:49,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103959940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:40:49,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:40:49,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 17:40:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591514209] [2022-07-22 17:40:49,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:40:49,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 17:40:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:49,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 17:40:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 17:40:49,940 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 17:40:50,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:50,035 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-07-22 17:40:50,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:40:50,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 17:40:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:50,039 INFO L225 Difference]: With dead ends: 59 [2022-07-22 17:40:50,043 INFO L226 Difference]: Without dead ends: 57 [2022-07-22 17:40:50,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:40:50,053 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:50,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 120 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:40:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-22 17:40:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-07-22 17:40:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-22 17:40:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-07-22 17:40:50,076 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 14 [2022-07-22 17:40:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:50,078 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-07-22 17:40:50,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 17:40:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-07-22 17:40:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 17:40:50,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:50,081 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:50,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 17:40:50,082 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:50,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1599171148, now seen corresponding path program 1 times [2022-07-22 17:40:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:50,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661896479] [2022-07-22 17:40:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:40:50,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:50,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661896479] [2022-07-22 17:40:50,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661896479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:40:50,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:40:50,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:40:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128249644] [2022-07-22 17:40:50,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:40:50,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:40:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:50,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:40:50,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:40:50,247 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 17:40:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:50,362 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-07-22 17:40:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 17:40:50,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 17:40:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:50,365 INFO L225 Difference]: With dead ends: 63 [2022-07-22 17:40:50,366 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 17:40:50,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:40:50,373 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 23 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:50,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 147 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:40:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 17:40:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2022-07-22 17:40:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-22 17:40:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-07-22 17:40:50,399 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 14 [2022-07-22 17:40:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:50,399 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-07-22 17:40:50,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 17:40:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-07-22 17:40:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 17:40:50,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:50,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:50,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 17:40:50,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2110562560, now seen corresponding path program 1 times [2022-07-22 17:40:50,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:50,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444201265] [2022-07-22 17:40:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:40:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:40:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:50,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444201265] [2022-07-22 17:40:50,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444201265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:40:50,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:40:50,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 17:40:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158674368] [2022-07-22 17:40:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:40:50,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 17:40:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:50,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 17:40:50,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:40:50,515 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 17:40:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:50,532 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-07-22 17:40:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:40:50,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-07-22 17:40:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:50,534 INFO L225 Difference]: With dead ends: 55 [2022-07-22 17:40:50,534 INFO L226 Difference]: Without dead ends: 51 [2022-07-22 17:40:50,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 17:40:50,535 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:50,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:40:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-22 17:40:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-22 17:40:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 states have internal predecessors, (44), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-22 17:40:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-07-22 17:40:50,542 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 20 [2022-07-22 17:40:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:50,543 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-07-22 17:40:50,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 17:40:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-07-22 17:40:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 17:40:50,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:50,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:50,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 17:40:50,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:50,545 INFO L85 PathProgramCache]: Analyzing trace with hash -291106652, now seen corresponding path program 1 times [2022-07-22 17:40:50,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:50,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218988775] [2022-07-22 17:40:50,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:50,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:40:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:40:50,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:50,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218988775] [2022-07-22 17:40:50,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218988775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:40:50,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:40:50,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 17:40:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319391268] [2022-07-22 17:40:50,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:40:50,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 17:40:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 17:40:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:40:50,627 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 17:40:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:50,746 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2022-07-22 17:40:50,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 17:40:50,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-07-22 17:40:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:50,756 INFO L225 Difference]: With dead ends: 69 [2022-07-22 17:40:50,756 INFO L226 Difference]: Without dead ends: 65 [2022-07-22 17:40:50,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-22 17:40:50,759 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:50,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 100 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:40:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-22 17:40:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2022-07-22 17:40:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-22 17:40:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-07-22 17:40:50,775 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 21 [2022-07-22 17:40:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:50,775 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2022-07-22 17:40:50,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 17:40:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-07-22 17:40:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 17:40:50,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:50,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:50,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 17:40:50,781 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:50,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1709846180, now seen corresponding path program 1 times [2022-07-22 17:40:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:50,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34784045] [2022-07-22 17:40:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:50,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:40:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:40:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:40:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:50,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34784045] [2022-07-22 17:40:50,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34784045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:40:50,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:40:50,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 17:40:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932910405] [2022-07-22 17:40:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:40:50,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:40:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:40:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:40:50,857 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 17:40:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:50,873 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2022-07-22 17:40:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 17:40:50,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-22 17:40:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:50,874 INFO L225 Difference]: With dead ends: 64 [2022-07-22 17:40:50,874 INFO L226 Difference]: Without dead ends: 55 [2022-07-22 17:40:50,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 17:40:50,875 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:50,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 17:40:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-22 17:40:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-22 17:40:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-22 17:40:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-07-22 17:40:50,886 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 27 [2022-07-22 17:40:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:50,886 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-07-22 17:40:50,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 17:40:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-07-22 17:40:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 17:40:50,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:50,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:50,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 17:40:50,888 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:50,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1148028586, now seen corresponding path program 1 times [2022-07-22 17:40:50,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:50,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590985051] [2022-07-22 17:40:50,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:50,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:50,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:40:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:51,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:40:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 17:40:51,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:51,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590985051] [2022-07-22 17:40:51,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590985051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:40:51,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083675361] [2022-07-22 17:40:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:51,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:51,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:40:51,062 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) [2022-07-22 17:40:51,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 17:40:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:51,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-22 17:40:51,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:40:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 17:40:51,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:40:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 17:40:51,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083675361] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:40:51,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:40:51,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2022-07-22 17:40:51,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111976325] [2022-07-22 17:40:51,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:40:51,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 17:40:51,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:51,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 17:40:51,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-22 17:40:51,479 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-22 17:40:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:51,653 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-07-22 17:40:51,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 17:40:51,654 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2022-07-22 17:40:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:51,655 INFO L225 Difference]: With dead ends: 63 [2022-07-22 17:40:51,655 INFO L226 Difference]: Without dead ends: 55 [2022-07-22 17:40:51,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-22 17:40:51,656 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:51,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 139 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:40:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-22 17:40:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-07-22 17:40:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-22 17:40:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-07-22 17:40:51,662 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 28 [2022-07-22 17:40:51,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:51,662 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-07-22 17:40:51,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-22 17:40:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-07-22 17:40:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 17:40:51,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:51,664 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:51,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 17:40:51,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:51,880 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:51,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash -729806600, now seen corresponding path program 1 times [2022-07-22 17:40:51,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:51,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679419188] [2022-07-22 17:40:51,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:51,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:51,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:51,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:40:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:40:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 17:40:52,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:52,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679419188] [2022-07-22 17:40:52,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679419188] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:40:52,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387620267] [2022-07-22 17:40:52,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:52,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:52,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:40:52,026 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) [2022-07-22 17:40:52,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 17:40:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:52,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 17:40:52,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:40:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 17:40:52,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:40:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 17:40:52,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387620267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:40:52,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:40:52,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-07-22 17:40:52,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634321644] [2022-07-22 17:40:52,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:40:52,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 17:40:52,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 17:40:52,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-07-22 17:40:52,448 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-22 17:40:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:52,633 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2022-07-22 17:40:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 17:40:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 29 [2022-07-22 17:40:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:52,635 INFO L225 Difference]: With dead ends: 74 [2022-07-22 17:40:52,635 INFO L226 Difference]: Without dead ends: 70 [2022-07-22 17:40:52,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2022-07-22 17:40:52,636 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:52,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 174 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:40:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-22 17:40:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-07-22 17:40:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-07-22 17:40:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-07-22 17:40:52,643 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 29 [2022-07-22 17:40:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:52,644 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2022-07-22 17:40:52,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-22 17:40:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-07-22 17:40:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 17:40:52,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:52,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:52,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 17:40:52,863 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,SelfDestructingSolverStorable7 [2022-07-22 17:40:52,863 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:52,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1241581992, now seen corresponding path program 1 times [2022-07-22 17:40:52,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:52,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135975234] [2022-07-22 17:40:52,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:52,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:52,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:52,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:40:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:52,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:40:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:40:52,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:52,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135975234] [2022-07-22 17:40:52,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135975234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:40:52,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:40:52,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 17:40:52,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560680037] [2022-07-22 17:40:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:40:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 17:40:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:52,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 17:40:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:40:52,953 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 17:40:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:53,085 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-07-22 17:40:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 17:40:53,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-07-22 17:40:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:53,087 INFO L225 Difference]: With dead ends: 80 [2022-07-22 17:40:53,087 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 17:40:53,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-22 17:40:53,088 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:53,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 113 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:40:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 17:40:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2022-07-22 17:40:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 10 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-22 17:40:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2022-07-22 17:40:53,095 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 29 [2022-07-22 17:40:53,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:53,095 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2022-07-22 17:40:53,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 17:40:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2022-07-22 17:40:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 17:40:53,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:53,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:53,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 17:40:53,097 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:53,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:53,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2029271682, now seen corresponding path program 1 times [2022-07-22 17:40:53,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:53,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938815670] [2022-07-22 17:40:53,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:53,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:53,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:53,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:40:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:53,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:40:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:53,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:40:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:40:53,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:53,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938815670] [2022-07-22 17:40:53,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938815670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:40:53,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804630696] [2022-07-22 17:40:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:53,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:53,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:40:53,210 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) [2022-07-22 17:40:53,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 17:40:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:53,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 17:40:53,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:40:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:40:53,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:40:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 17:40:53,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804630696] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:40:53,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:40:53,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 20 [2022-07-22 17:40:53,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519636460] [2022-07-22 17:40:53,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:40:53,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 17:40:53,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:53,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 17:40:53,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-07-22 17:40:53,895 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-22 17:40:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:54,128 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2022-07-22 17:40:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 17:40:54,129 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Word has length 36 [2022-07-22 17:40:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:54,130 INFO L225 Difference]: With dead ends: 89 [2022-07-22 17:40:54,130 INFO L226 Difference]: Without dead ends: 85 [2022-07-22 17:40:54,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2022-07-22 17:40:54,131 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:54,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 201 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:40:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-22 17:40:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2022-07-22 17:40:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 11 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (27), 17 states have call predecessors, (27), 11 states have call successors, (27) [2022-07-22 17:40:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2022-07-22 17:40:54,148 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 36 [2022-07-22 17:40:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:54,148 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2022-07-22 17:40:54,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 states have internal predecessors, (51), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-22 17:40:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-07-22 17:40:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 17:40:54,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:54,155 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:54,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 17:40:54,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:54,380 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:54,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash -122584798, now seen corresponding path program 1 times [2022-07-22 17:40:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:54,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270981000] [2022-07-22 17:40:54,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:54,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:54,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:40:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:54,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:40:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:54,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:40:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 17:40:54,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:54,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270981000] [2022-07-22 17:40:54,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270981000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:40:54,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160356896] [2022-07-22 17:40:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:54,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:54,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:40:54,510 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) [2022-07-22 17:40:54,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 17:40:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:54,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-22 17:40:54,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:40:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 17:40:54,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:40:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 17:40:54,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160356896] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:40:54,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:40:54,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2022-07-22 17:40:54,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500033561] [2022-07-22 17:40:54,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:40:54,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 17:40:54,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:54,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 17:40:54,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-22 17:40:54,842 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-22 17:40:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:55,030 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2022-07-22 17:40:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 17:40:55,031 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 36 [2022-07-22 17:40:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:55,032 INFO L225 Difference]: With dead ends: 84 [2022-07-22 17:40:55,032 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 17:40:55,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-07-22 17:40:55,033 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:55,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 119 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:40:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 17:40:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-22 17:40:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (26), 16 states have call predecessors, (26), 11 states have call successors, (26) [2022-07-22 17:40:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2022-07-22 17:40:55,047 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 36 [2022-07-22 17:40:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:55,048 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2022-07-22 17:40:55,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-22 17:40:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2022-07-22 17:40:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 17:40:55,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:55,050 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:55,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 17:40:55,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:55,251 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:55,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:55,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1326914756, now seen corresponding path program 1 times [2022-07-22 17:40:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:55,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951846907] [2022-07-22 17:40:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:55,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:40:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:55,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:40:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:55,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:40:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 17:40:55,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:55,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951846907] [2022-07-22 17:40:55,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951846907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:40:55,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571441572] [2022-07-22 17:40:55,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:55,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:55,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:40:55,441 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) [2022-07-22 17:40:55,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 17:40:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:55,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-22 17:40:55,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:40:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 17:40:55,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:40:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 17:40:56,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571441572] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:40:56,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:40:56,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 39 [2022-07-22 17:40:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674540081] [2022-07-22 17:40:56,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:40:56,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 17:40:56,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:56,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 17:40:56,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2022-07-22 17:40:56,387 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 39 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 9 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-22 17:40:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:56,927 INFO L93 Difference]: Finished difference Result 121 states and 159 transitions. [2022-07-22 17:40:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 17:40:56,928 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 9 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 37 [2022-07-22 17:40:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:56,929 INFO L225 Difference]: With dead ends: 121 [2022-07-22 17:40:56,929 INFO L226 Difference]: Without dead ends: 117 [2022-07-22 17:40:56,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=2045, Unknown=0, NotChecked=0, Total=2352 [2022-07-22 17:40:56,930 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 87 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:56,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 332 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:40:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-22 17:40:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 78. [2022-07-22 17:40:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 11 states have call successors, (11), 4 states have call predecessors, (11), 13 states have return successors, (31), 18 states have call predecessors, (31), 11 states have call successors, (31) [2022-07-22 17:40:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2022-07-22 17:40:56,952 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 37 [2022-07-22 17:40:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:56,952 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2022-07-22 17:40:56,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 9 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-22 17:40:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2022-07-22 17:40:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 17:40:56,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:56,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:56,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 17:40:57,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 17:40:57,164 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:57,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash -238590844, now seen corresponding path program 2 times [2022-07-22 17:40:57,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:57,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946741839] [2022-07-22 17:40:57,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:57,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:57,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:57,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:40:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:40:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:40:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 17:40:57,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:57,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946741839] [2022-07-22 17:40:57,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946741839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:40:57,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555006760] [2022-07-22 17:40:57,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:40:57,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:57,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:40:57,288 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) [2022-07-22 17:40:57,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 17:40:57,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:40:57,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:40:57,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-22 17:40:57,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:40:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 17:40:57,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:40:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 17:40:57,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555006760] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:40:57,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:40:57,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 22 [2022-07-22 17:40:57,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568698139] [2022-07-22 17:40:57,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:40:57,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 17:40:57,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:57,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 17:40:57,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2022-07-22 17:40:57,883 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 22 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 17 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-22 17:40:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:40:58,211 INFO L93 Difference]: Finished difference Result 96 states and 128 transitions. [2022-07-22 17:40:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 17:40:58,212 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 17 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) Word has length 37 [2022-07-22 17:40:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:40:58,213 INFO L225 Difference]: With dead ends: 96 [2022-07-22 17:40:58,213 INFO L226 Difference]: Without dead ends: 92 [2022-07-22 17:40:58,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 17:40:58,214 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:40:58,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 195 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:40:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-22 17:40:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2022-07-22 17:40:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 10 states have call successors, (10), 4 states have call predecessors, (10), 9 states have return successors, (19), 13 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-22 17:40:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2022-07-22 17:40:58,227 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 37 [2022-07-22 17:40:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:40:58,227 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2022-07-22 17:40:58,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 17 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-22 17:40:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-07-22 17:40:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 17:40:58,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:40:58,228 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:40:58,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 17:40:58,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:58,444 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:40:58,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:40:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash 861262790, now seen corresponding path program 2 times [2022-07-22 17:40:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:40:58,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958470234] [2022-07-22 17:40:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:40:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:40:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:40:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:58,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:40:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:40:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:40:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:40:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:40:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:40:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 17:40:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:40:58,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958470234] [2022-07-22 17:40:58,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958470234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:40:58,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868516874] [2022-07-22 17:40:58,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:40:58,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:40:58,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:40:58,644 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) [2022-07-22 17:40:58,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 17:40:58,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:40:58,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:40:58,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-22 17:40:58,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:40:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 17:40:58,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:40:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 17:40:59,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868516874] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:40:59,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:40:59,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 18] total 27 [2022-07-22 17:40:59,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613591216] [2022-07-22 17:40:59,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:40:59,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 17:40:59,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:40:59,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 17:40:59,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-07-22 17:40:59,914 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 23 states have internal predecessors, (68), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-22 17:41:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:00,300 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-07-22 17:41:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 17:41:00,300 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 23 states have internal predecessors, (68), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) Word has length 51 [2022-07-22 17:41:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:00,301 INFO L225 Difference]: With dead ends: 94 [2022-07-22 17:41:00,301 INFO L226 Difference]: Without dead ends: 90 [2022-07-22 17:41:00,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 83 SyntacticMatches, 16 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2022-07-22 17:41:00,302 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:00,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 369 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:41:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-22 17:41:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2022-07-22 17:41:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 11 states have call successors, (11), 4 states have call predecessors, (11), 12 states have return successors, (28), 17 states have call predecessors, (28), 11 states have call successors, (28) [2022-07-22 17:41:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2022-07-22 17:41:00,310 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 51 [2022-07-22 17:41:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:00,310 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2022-07-22 17:41:00,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 23 states have internal predecessors, (68), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-22 17:41:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2022-07-22 17:41:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 17:41:00,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:00,311 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:00,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:00,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:00,532 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:00,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash -124726374, now seen corresponding path program 3 times [2022-07-22 17:41:00,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:00,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062042837] [2022-07-22 17:41:00,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:00,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:00,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:00,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:41:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 17:41:00,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:00,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062042837] [2022-07-22 17:41:00,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062042837] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:00,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393518820] [2022-07-22 17:41:00,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 17:41:00,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:00,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:00,708 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) [2022-07-22 17:41:00,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 17:41:00,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 17:41:00,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:00,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-22 17:41:00,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 17:41:01,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:41:01,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393518820] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:01,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:01,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 31 [2022-07-22 17:41:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216712636] [2022-07-22 17:41:01,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:01,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-22 17:41:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:01,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 17:41:01,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2022-07-22 17:41:01,659 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 31 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-22 17:41:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:01,982 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-07-22 17:41:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 17:41:01,983 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 12 states have call successors, (13) Word has length 43 [2022-07-22 17:41:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:01,984 INFO L225 Difference]: With dead ends: 84 [2022-07-22 17:41:01,984 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 17:41:01,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2022-07-22 17:41:01,985 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:01,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 259 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:41:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 17:41:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-07-22 17:41:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 10 states have call successors, (10), 4 states have call predecessors, (10), 11 states have return successors, (24), 15 states have call predecessors, (24), 10 states have call successors, (24) [2022-07-22 17:41:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2022-07-22 17:41:01,991 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 43 [2022-07-22 17:41:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:01,991 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2022-07-22 17:41:01,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-22 17:41:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-07-22 17:41:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 17:41:01,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:01,993 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:02,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:02,204 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,SelfDestructingSolverStorable14 [2022-07-22 17:41:02,205 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:02,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1270773450, now seen corresponding path program 1 times [2022-07-22 17:41:02,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:02,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256732196] [2022-07-22 17:41:02,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:41:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 17:41:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:02,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256732196] [2022-07-22 17:41:02,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256732196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:02,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623516294] [2022-07-22 17:41:02,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:02,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:02,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:02,396 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) [2022-07-22 17:41:02,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 17:41:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:02,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 17:41:02,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 17:41:02,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:41:03,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623516294] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:03,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:03,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 34 [2022-07-22 17:41:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050472087] [2022-07-22 17:41:03,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:03,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 17:41:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:03,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 17:41:03,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 17:41:03,523 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 34 states, 31 states have (on average 2.225806451612903) internal successors, (69), 27 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-22 17:41:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:04,092 INFO L93 Difference]: Finished difference Result 112 states and 148 transitions. [2022-07-22 17:41:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 17:41:04,092 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.225806451612903) internal successors, (69), 27 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) Word has length 44 [2022-07-22 17:41:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:04,093 INFO L225 Difference]: With dead ends: 112 [2022-07-22 17:41:04,093 INFO L226 Difference]: Without dead ends: 108 [2022-07-22 17:41:04,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=1791, Unknown=0, NotChecked=0, Total=2070 [2022-07-22 17:41:04,094 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 67 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:04,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 397 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:41:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-22 17:41:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2022-07-22 17:41:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 14 states have return successors, (32), 20 states have call predecessors, (32), 11 states have call successors, (32) [2022-07-22 17:41:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-07-22 17:41:04,104 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 44 [2022-07-22 17:41:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:04,104 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-07-22 17:41:04,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.225806451612903) internal successors, (69), 27 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-22 17:41:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-07-22 17:41:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 17:41:04,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:04,105 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:04,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:04,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 17:41:04,319 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash 132450678, now seen corresponding path program 2 times [2022-07-22 17:41:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:04,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310006630] [2022-07-22 17:41:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:04,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:04,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:04,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:04,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:41:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:04,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 17:41:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:04,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310006630] [2022-07-22 17:41:04,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310006630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:04,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436300088] [2022-07-22 17:41:04,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:41:04,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:04,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:04,458 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) [2022-07-22 17:41:04,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 17:41:04,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:41:04,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:04,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 17:41:04,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 17:41:04,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 17:41:05,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436300088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:05,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:05,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 21 [2022-07-22 17:41:05,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806325129] [2022-07-22 17:41:05,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:05,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 17:41:05,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 17:41:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-22 17:41:05,255 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 21 states, 20 states have (on average 2.75) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-22 17:41:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:05,516 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2022-07-22 17:41:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 17:41:05,517 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) Word has length 44 [2022-07-22 17:41:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:05,518 INFO L225 Difference]: With dead ends: 109 [2022-07-22 17:41:05,519 INFO L226 Difference]: Without dead ends: 105 [2022-07-22 17:41:05,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 72 SyntacticMatches, 16 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2022-07-22 17:41:05,520 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:05,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 297 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:41:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-22 17:41:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2022-07-22 17:41:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 11 states have call successors, (11), 4 states have call predecessors, (11), 16 states have return successors, (38), 23 states have call predecessors, (38), 11 states have call successors, (38) [2022-07-22 17:41:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2022-07-22 17:41:05,534 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 44 [2022-07-22 17:41:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:05,534 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2022-07-22 17:41:05,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-22 17:41:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2022-07-22 17:41:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-22 17:41:05,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:05,538 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:05,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:05,751 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,SelfDestructingSolverStorable16 [2022-07-22 17:41:05,751 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:05,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:05,752 INFO L85 PathProgramCache]: Analyzing trace with hash 815065250, now seen corresponding path program 3 times [2022-07-22 17:41:05,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:05,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045088959] [2022-07-22 17:41:05,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:05,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:05,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:05,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:05,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:05,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:41:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:05,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 17:41:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:05,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045088959] [2022-07-22 17:41:05,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045088959] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:05,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532047557] [2022-07-22 17:41:05,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 17:41:05,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:05,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:05,972 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) [2022-07-22 17:41:05,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 17:41:06,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 17:41:06,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:06,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-22 17:41:06,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 17:41:06,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 17:41:10,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532047557] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:10,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:10,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 21] total 45 [2022-07-22 17:41:10,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290953820] [2022-07-22 17:41:10,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:10,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-22 17:41:10,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-22 17:41:10,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1828, Unknown=3, NotChecked=0, Total=1980 [2022-07-22 17:41:10,083 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand has 45 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 33 states have internal predecessors, (89), 16 states have call successors, (18), 1 states have call predecessors, (18), 12 states have return successors, (18), 14 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-22 17:41:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:10,963 INFO L93 Difference]: Finished difference Result 148 states and 196 transitions. [2022-07-22 17:41:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 17:41:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 33 states have internal predecessors, (89), 16 states have call successors, (18), 1 states have call predecessors, (18), 12 states have return successors, (18), 14 states have call predecessors, (18), 16 states have call successors, (18) Word has length 52 [2022-07-22 17:41:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:10,965 INFO L225 Difference]: With dead ends: 148 [2022-07-22 17:41:10,965 INFO L226 Difference]: Without dead ends: 144 [2022-07-22 17:41:10,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=340, Invalid=3079, Unknown=3, NotChecked=0, Total=3422 [2022-07-22 17:41:10,966 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 62 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:10,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 492 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 775 Invalid, 0 Unknown, 44 Unchecked, 0.4s Time] [2022-07-22 17:41:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-22 17:41:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 97. [2022-07-22 17:41:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 65 states have internal predecessors, (73), 11 states have call successors, (11), 4 states have call predecessors, (11), 18 states have return successors, (44), 27 states have call predecessors, (44), 11 states have call successors, (44) [2022-07-22 17:41:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2022-07-22 17:41:10,980 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 52 [2022-07-22 17:41:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:10,980 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2022-07-22 17:41:10,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 33 states have internal predecessors, (89), 16 states have call successors, (18), 1 states have call predecessors, (18), 12 states have return successors, (18), 14 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-22 17:41:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2022-07-22 17:41:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-22 17:41:10,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:10,982 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:11,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:11,199 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,SelfDestructingSolverStorable17 [2022-07-22 17:41:11,200 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:11,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:11,200 INFO L85 PathProgramCache]: Analyzing trace with hash 850048834, now seen corresponding path program 4 times [2022-07-22 17:41:11,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:11,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922417246] [2022-07-22 17:41:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:11,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:11,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:11,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:11,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:41:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 17:41:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:11,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922417246] [2022-07-22 17:41:11,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922417246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:11,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427708105] [2022-07-22 17:41:11,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 17:41:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:11,410 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) [2022-07-22 17:41:11,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 17:41:11,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 17:41:11,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:11,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-22 17:41:11,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 17:41:11,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 17:41:12,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427708105] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:12,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:12,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 20] total 37 [2022-07-22 17:41:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134709906] [2022-07-22 17:41:12,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:12,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-22 17:41:12,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-22 17:41:12,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 17:41:12,960 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 37 states, 34 states have (on average 2.264705882352941) internal successors, (77), 28 states have internal predecessors, (77), 13 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) [2022-07-22 17:41:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:13,623 INFO L93 Difference]: Finished difference Result 135 states and 183 transitions. [2022-07-22 17:41:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 17:41:13,623 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.264705882352941) internal successors, (77), 28 states have internal predecessors, (77), 13 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) Word has length 52 [2022-07-22 17:41:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:13,624 INFO L225 Difference]: With dead ends: 135 [2022-07-22 17:41:13,624 INFO L226 Difference]: Without dead ends: 131 [2022-07-22 17:41:13,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 84 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=2205, Unknown=0, NotChecked=0, Total=2550 [2022-07-22 17:41:13,626 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:13,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 464 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:41:13,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-22 17:41:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 70. [2022-07-22 17:41:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 10 states have call successors, (10), 4 states have call predecessors, (10), 11 states have return successors, (22), 15 states have call predecessors, (22), 10 states have call successors, (22) [2022-07-22 17:41:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-07-22 17:41:13,634 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 52 [2022-07-22 17:41:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:13,634 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-07-22 17:41:13,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.264705882352941) internal successors, (77), 28 states have internal predecessors, (77), 13 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) [2022-07-22 17:41:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-07-22 17:41:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 17:41:13,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:13,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:13,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:13,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:13,851 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2103225754, now seen corresponding path program 5 times [2022-07-22 17:41:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:13,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515826595] [2022-07-22 17:41:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:13,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:13,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:13,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:41:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:14,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 17:41:14,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:14,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515826595] [2022-07-22 17:41:14,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515826595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:14,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134455311] [2022-07-22 17:41:14,034 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 17:41:14,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:14,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:14,036 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) [2022-07-22 17:41:14,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 17:41:14,124 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-22 17:41:14,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:14,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-22 17:41:14,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 17:41:14,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 17:41:15,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134455311] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:15,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:15,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 18] total 27 [2022-07-22 17:41:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71204537] [2022-07-22 17:41:15,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:15,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 17:41:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 17:41:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-07-22 17:41:15,152 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 23 states have internal predecessors, (68), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-22 17:41:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:15,484 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-07-22 17:41:15,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 17:41:15,486 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 23 states have internal predecessors, (68), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) Word has length 51 [2022-07-22 17:41:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:15,487 INFO L225 Difference]: With dead ends: 97 [2022-07-22 17:41:15,487 INFO L226 Difference]: Without dead ends: 93 [2022-07-22 17:41:15,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2022-07-22 17:41:15,488 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:15,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 384 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:41:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-22 17:41:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2022-07-22 17:41:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 12 states have return successors, (24), 16 states have call predecessors, (24), 10 states have call successors, (24) [2022-07-22 17:41:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2022-07-22 17:41:15,496 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 51 [2022-07-22 17:41:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:15,496 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2022-07-22 17:41:15,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 23 states have internal predecessors, (68), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-22 17:41:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2022-07-22 17:41:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 17:41:15,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:15,497 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:15,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:15,711 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,SelfDestructingSolverStorable19 [2022-07-22 17:41:15,711 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:15,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash -262469082, now seen corresponding path program 6 times [2022-07-22 17:41:15,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:15,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290037338] [2022-07-22 17:41:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:15,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:15,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:15,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:15,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:41:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:15,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:15,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 17:41:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:15,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290037338] [2022-07-22 17:41:15,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290037338] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:15,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995831742] [2022-07-22 17:41:15,936 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 17:41:15,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:15,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:15,937 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) [2022-07-22 17:41:15,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 17:41:16,039 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-22 17:41:16,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:16,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 17:41:16,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 17:41:16,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 17:41:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995831742] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:17,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 33 [2022-07-22 17:41:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241623862] [2022-07-22 17:41:17,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:17,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 17:41:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 17:41:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 17:41:17,085 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 33 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 12 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (16), 9 states have call predecessors, (16), 12 states have call successors, (16) [2022-07-22 17:41:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:17,465 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2022-07-22 17:41:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 17:41:17,466 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 12 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (16), 9 states have call predecessors, (16), 12 states have call successors, (16) Word has length 51 [2022-07-22 17:41:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:17,467 INFO L225 Difference]: With dead ends: 91 [2022-07-22 17:41:17,467 INFO L226 Difference]: Without dead ends: 82 [2022-07-22 17:41:17,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 82 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=1439, Unknown=0, NotChecked=0, Total=1640 [2022-07-22 17:41:17,468 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 60 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:17,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 329 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:41:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-22 17:41:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2022-07-22 17:41:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 10 states have call successors, (10), 4 states have call predecessors, (10), 12 states have return successors, (24), 17 states have call predecessors, (24), 10 states have call successors, (24) [2022-07-22 17:41:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2022-07-22 17:41:17,474 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 51 [2022-07-22 17:41:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:17,474 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2022-07-22 17:41:17,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 12 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (16), 9 states have call predecessors, (16), 12 states have call successors, (16) [2022-07-22 17:41:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2022-07-22 17:41:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-22 17:41:17,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:17,475 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:17,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:17,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:17,690 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:17,690 INFO L85 PathProgramCache]: Analyzing trace with hash 334535194, now seen corresponding path program 4 times [2022-07-22 17:41:17,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:17,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100185553] [2022-07-22 17:41:17,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:17,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:17,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:17,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:41:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 17:41:17,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:17,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100185553] [2022-07-22 17:41:17,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100185553] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:17,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198364511] [2022-07-22 17:41:17,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 17:41:17,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:17,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:17,900 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:41:17,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 17:41:18,032 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 17:41:18,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:18,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 17:41:18,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 17:41:18,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:20,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198364511] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:20,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:41:20,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2022-07-22 17:41:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12036862] [2022-07-22 17:41:20,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:20,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-22 17:41:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:20,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 17:41:20,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 17:41:20,094 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 31 states, 28 states have (on average 2.107142857142857) internal successors, (59), 23 states have internal predecessors, (59), 11 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:41:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:20,713 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2022-07-22 17:41:20,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 17:41:20,713 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.107142857142857) internal successors, (59), 23 states have internal predecessors, (59), 11 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-07-22 17:41:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:20,714 INFO L225 Difference]: With dead ends: 106 [2022-07-22 17:41:20,714 INFO L226 Difference]: Without dead ends: 102 [2022-07-22 17:41:20,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=239, Invalid=2211, Unknown=0, NotChecked=0, Total=2450 [2022-07-22 17:41:20,716 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 54 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:20,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 441 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:41:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-22 17:41:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2022-07-22 17:41:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 10 states have call successors, (10), 4 states have call predecessors, (10), 13 states have return successors, (27), 17 states have call predecessors, (27), 10 states have call successors, (27) [2022-07-22 17:41:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2022-07-22 17:41:20,721 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 59 [2022-07-22 17:41:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:20,721 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2022-07-22 17:41:20,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.107142857142857) internal successors, (59), 23 states have internal predecessors, (59), 11 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:41:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2022-07-22 17:41:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-22 17:41:20,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:20,722 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:20,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:20,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:20,934 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:20,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1972765050, now seen corresponding path program 7 times [2022-07-22 17:41:20,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:20,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808721307] [2022-07-22 17:41:20,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:20,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:20,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:21,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:41:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:21,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 17:41:21,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:21,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808721307] [2022-07-22 17:41:21,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808721307] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:21,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74660187] [2022-07-22 17:41:21,147 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 17:41:21,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:21,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:21,149 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:41:21,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 17:41:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:21,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-22 17:41:21,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 17:41:21,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 17:41:22,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74660187] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:22,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:22,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 28 [2022-07-22 17:41:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578654301] [2022-07-22 17:41:22,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:22,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 17:41:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 17:41:22,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-07-22 17:41:22,735 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 23 states have internal predecessors, (72), 12 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-22 17:41:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:23,036 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2022-07-22 17:41:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 17:41:23,037 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 23 states have internal predecessors, (72), 12 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) Word has length 59 [2022-07-22 17:41:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:23,038 INFO L225 Difference]: With dead ends: 109 [2022-07-22 17:41:23,038 INFO L226 Difference]: Without dead ends: 105 [2022-07-22 17:41:23,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 97 SyntacticMatches, 21 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 17:41:23,043 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:23,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 344 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:41:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-22 17:41:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2022-07-22 17:41:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.103448275862069) internal successors, (64), 58 states have internal predecessors, (64), 10 states have call successors, (10), 4 states have call predecessors, (10), 15 states have return successors, (33), 21 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-22 17:41:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-07-22 17:41:23,051 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 59 [2022-07-22 17:41:23,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:23,052 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-07-22 17:41:23,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 23 states have internal predecessors, (72), 12 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-22 17:41:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-07-22 17:41:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-22 17:41:23,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:23,053 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:23,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:23,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-22 17:41:23,260 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash 12091098, now seen corresponding path program 8 times [2022-07-22 17:41:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:23,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629288706] [2022-07-22 17:41:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:23,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:23,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:23,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:23,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:23,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:41:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:23,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 17:41:23,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:23,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629288706] [2022-07-22 17:41:23,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629288706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:23,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238870890] [2022-07-22 17:41:23,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:41:23,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:23,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:23,464 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:41:23,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 17:41:23,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:41:23,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:23,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-22 17:41:23,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 17:41:23,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 17:41:25,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238870890] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:25,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:25,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 28 [2022-07-22 17:41:25,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487134742] [2022-07-22 17:41:25,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:25,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 17:41:25,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:25,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 17:41:25,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-07-22 17:41:25,066 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 23 states have internal predecessors, (72), 12 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-22 17:41:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:25,425 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2022-07-22 17:41:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 17:41:25,426 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 23 states have internal predecessors, (72), 12 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) Word has length 59 [2022-07-22 17:41:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:25,427 INFO L225 Difference]: With dead ends: 113 [2022-07-22 17:41:25,427 INFO L226 Difference]: Without dead ends: 109 [2022-07-22 17:41:25,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 98 SyntacticMatches, 20 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 17:41:25,428 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 49 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:25,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 444 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:41:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-22 17:41:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 84. [2022-07-22 17:41:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.103448275862069) internal successors, (64), 58 states have internal predecessors, (64), 10 states have call successors, (10), 4 states have call predecessors, (10), 15 states have return successors, (33), 21 states have call predecessors, (33), 10 states have call successors, (33) [2022-07-22 17:41:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-07-22 17:41:25,435 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 59 [2022-07-22 17:41:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:25,435 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-07-22 17:41:25,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 23 states have internal predecessors, (72), 12 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-22 17:41:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-07-22 17:41:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-22 17:41:25,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:25,437 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:25,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:25,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:25,643 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:25,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:25,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1626138758, now seen corresponding path program 9 times [2022-07-22 17:41:25,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:25,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919879676] [2022-07-22 17:41:25,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:25,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:25,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:25,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:25,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:41:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:25,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 17:41:25,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:25,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919879676] [2022-07-22 17:41:25,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919879676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:25,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328956937] [2022-07-22 17:41:25,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 17:41:25,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:25,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:25,948 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:41:25,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-22 17:41:26,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 17:41:26,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:26,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 17:41:26,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 17:41:27,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:28,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328956937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:28,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:41:28,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 34 [2022-07-22 17:41:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069772656] [2022-07-22 17:41:28,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:28,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 17:41:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:28,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 17:41:28,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1674, Unknown=1, NotChecked=0, Total=1806 [2022-07-22 17:41:28,286 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 34 states, 30 states have (on average 2.1) internal successors, (63), 26 states have internal predecessors, (63), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:41:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:33,461 INFO L93 Difference]: Finished difference Result 157 states and 208 transitions. [2022-07-22 17:41:33,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 17:41:33,462 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 2.1) internal successors, (63), 26 states have internal predecessors, (63), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-07-22 17:41:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:33,463 INFO L225 Difference]: With dead ends: 157 [2022-07-22 17:41:33,463 INFO L226 Difference]: Without dead ends: 153 [2022-07-22 17:41:33,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=303, Invalid=2888, Unknown=1, NotChecked=0, Total=3192 [2022-07-22 17:41:33,465 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:33,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 522 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 828 Invalid, 0 Unknown, 79 Unchecked, 0.3s Time] [2022-07-22 17:41:33,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-22 17:41:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 104. [2022-07-22 17:41:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 70 states have internal predecessors, (78), 10 states have call successors, (10), 4 states have call predecessors, (10), 21 states have return successors, (50), 29 states have call predecessors, (50), 10 states have call successors, (50) [2022-07-22 17:41:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2022-07-22 17:41:33,474 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 59 [2022-07-22 17:41:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:33,475 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2022-07-22 17:41:33,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 2.1) internal successors, (63), 26 states have internal predecessors, (63), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:41:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2022-07-22 17:41:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-22 17:41:33,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:33,476 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:33,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:33,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:33,687 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1786558534, now seen corresponding path program 10 times [2022-07-22 17:41:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:33,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698212595] [2022-07-22 17:41:33,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:33,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:33,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:33,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:41:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:33,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:33,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 17:41:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:33,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698212595] [2022-07-22 17:41:33,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698212595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:33,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194424703] [2022-07-22 17:41:33,924 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 17:41:33,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:33,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:33,925 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:41:33,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-22 17:41:34,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 17:41:34,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:34,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 17:41:34,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 17:41:36,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:38,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194424703] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:38,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:41:38,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 32 [2022-07-22 17:41:38,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707196271] [2022-07-22 17:41:38,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:38,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-22 17:41:38,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:38,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-22 17:41:38,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 17:41:38,081 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 24 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:41:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:38,837 INFO L93 Difference]: Finished difference Result 168 states and 229 transitions. [2022-07-22 17:41:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 17:41:38,838 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 24 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-07-22 17:41:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:38,839 INFO L225 Difference]: With dead ends: 168 [2022-07-22 17:41:38,839 INFO L226 Difference]: Without dead ends: 164 [2022-07-22 17:41:38,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=302, Invalid=2454, Unknown=0, NotChecked=0, Total=2756 [2022-07-22 17:41:38,841 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:38,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 507 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 529 Invalid, 0 Unknown, 158 Unchecked, 0.3s Time] [2022-07-22 17:41:38,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-22 17:41:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 109. [2022-07-22 17:41:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 72 states have internal predecessors, (82), 10 states have call successors, (10), 4 states have call predecessors, (10), 22 states have return successors, (53), 32 states have call predecessors, (53), 10 states have call successors, (53) [2022-07-22 17:41:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 145 transitions. [2022-07-22 17:41:38,851 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 145 transitions. Word has length 59 [2022-07-22 17:41:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:38,851 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 145 transitions. [2022-07-22 17:41:38,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 24 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:41:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 145 transitions. [2022-07-22 17:41:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-22 17:41:38,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:38,853 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:38,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-22 17:41:39,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:39,071 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:39,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash 547734810, now seen corresponding path program 11 times [2022-07-22 17:41:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:39,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386305081] [2022-07-22 17:41:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:39,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:41:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:39,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 17:41:39,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:39,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386305081] [2022-07-22 17:41:39,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386305081] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:39,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978484283] [2022-07-22 17:41:39,366 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 17:41:39,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:39,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:39,367 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:41:39,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-22 17:41:39,532 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 17:41:39,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:39,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 17:41:39,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 17:41:39,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 17:41:41,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978484283] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:41,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:41,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 22] total 41 [2022-07-22 17:41:41,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710301624] [2022-07-22 17:41:41,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:41,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-22 17:41:41,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:41,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-22 17:41:41,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1503, Unknown=0, NotChecked=0, Total=1640 [2022-07-22 17:41:41,556 INFO L87 Difference]: Start difference. First operand 109 states and 145 transitions. Second operand has 41 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (19), 12 states have call predecessors, (19), 15 states have call successors, (19) [2022-07-22 17:41:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:42,623 INFO L93 Difference]: Finished difference Result 201 states and 278 transitions. [2022-07-22 17:41:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 17:41:42,624 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (19), 12 states have call predecessors, (19), 15 states have call successors, (19) Word has length 59 [2022-07-22 17:41:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:42,628 INFO L225 Difference]: With dead ends: 201 [2022-07-22 17:41:42,628 INFO L226 Difference]: Without dead ends: 197 [2022-07-22 17:41:42,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 96 SyntacticMatches, 11 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=365, Invalid=2715, Unknown=0, NotChecked=0, Total=3080 [2022-07-22 17:41:42,630 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:42,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 621 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 17:41:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-22 17:41:42,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 124. [2022-07-22 17:41:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 86 states have (on average 1.069767441860465) internal successors, (92), 82 states have internal predecessors, (92), 10 states have call successors, (10), 4 states have call predecessors, (10), 27 states have return successors, (68), 37 states have call predecessors, (68), 10 states have call successors, (68) [2022-07-22 17:41:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2022-07-22 17:41:42,646 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 59 [2022-07-22 17:41:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:42,647 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2022-07-22 17:41:42,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (19), 12 states have call predecessors, (19), 15 states have call successors, (19) [2022-07-22 17:41:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2022-07-22 17:41:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-22 17:41:42,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:42,650 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 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] [2022-07-22 17:41:42,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-22 17:41:42,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-22 17:41:42,851 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 789094822, now seen corresponding path program 12 times [2022-07-22 17:41:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:42,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646595214] [2022-07-22 17:41:42,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:43,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:43,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:41:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 17:41:43,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:43,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646595214] [2022-07-22 17:41:43,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646595214] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:43,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163217861] [2022-07-22 17:41:43,159 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 17:41:43,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:43,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:43,160 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:41:43,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-22 17:41:43,380 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-22 17:41:43,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:43,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-22 17:41:43,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 17:41:43,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:45,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163217861] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:45,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:41:45,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 32 [2022-07-22 17:41:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763756722] [2022-07-22 17:41:45,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:45,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-22 17:41:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:45,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-22 17:41:45,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 17:41:45,889 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand has 32 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 24 states have internal predecessors, (65), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:41:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:47,107 INFO L93 Difference]: Finished difference Result 189 states and 265 transitions. [2022-07-22 17:41:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 17:41:47,108 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 24 states have internal predecessors, (65), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 67 [2022-07-22 17:41:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:47,109 INFO L225 Difference]: With dead ends: 189 [2022-07-22 17:41:47,109 INFO L226 Difference]: Without dead ends: 185 [2022-07-22 17:41:47,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 81 SyntacticMatches, 13 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=340, Invalid=2740, Unknown=0, NotChecked=0, Total=3080 [2022-07-22 17:41:47,111 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:47,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 648 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 17:41:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-22 17:41:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 132. [2022-07-22 17:41:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 92 states have (on average 1.065217391304348) internal successors, (98), 86 states have internal predecessors, (98), 10 states have call successors, (10), 4 states have call predecessors, (10), 29 states have return successors, (74), 41 states have call predecessors, (74), 10 states have call successors, (74) [2022-07-22 17:41:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2022-07-22 17:41:47,123 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 67 [2022-07-22 17:41:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:47,124 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2022-07-22 17:41:47,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 24 states have internal predecessors, (65), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:41:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2022-07-22 17:41:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-22 17:41:47,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:47,125 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:47,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:47,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-22 17:41:47,338 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:47,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1906616390, now seen corresponding path program 13 times [2022-07-22 17:41:47,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:47,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637321504] [2022-07-22 17:41:47,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:47,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:47,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:47,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:47,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:41:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:47,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:47,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 13 proven. 37 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:41:47,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:47,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637321504] [2022-07-22 17:41:47,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637321504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:47,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284397445] [2022-07-22 17:41:47,690 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 17:41:47,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:47,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:47,692 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:41:47,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-22 17:41:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:47,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-22 17:41:47,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 17:41:48,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 5 proven. 59 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 17:41:50,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284397445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:50,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:50,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 25] total 45 [2022-07-22 17:41:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323222259] [2022-07-22 17:41:50,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:50,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-22 17:41:50,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:50,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-22 17:41:50,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1833, Unknown=0, NotChecked=0, Total=1980 [2022-07-22 17:41:50,676 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 45 states, 40 states have (on average 2.3) internal successors, (92), 35 states have internal predecessors, (92), 17 states have call successors, (20), 1 states have call predecessors, (20), 11 states have return successors, (24), 13 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-22 17:41:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:51,808 INFO L93 Difference]: Finished difference Result 189 states and 261 transitions. [2022-07-22 17:41:51,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 17:41:51,809 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.3) internal successors, (92), 35 states have internal predecessors, (92), 17 states have call successors, (20), 1 states have call predecessors, (20), 11 states have return successors, (24), 13 states have call predecessors, (24), 17 states have call successors, (24) Word has length 67 [2022-07-22 17:41:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:51,810 INFO L225 Difference]: With dead ends: 189 [2022-07-22 17:41:51,810 INFO L226 Difference]: Without dead ends: 185 [2022-07-22 17:41:51,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 109 SyntacticMatches, 15 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=436, Invalid=3224, Unknown=0, NotChecked=0, Total=3660 [2022-07-22 17:41:51,811 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 97 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:51,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 713 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 17:41:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-22 17:41:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 111. [2022-07-22 17:41:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.077922077922078) internal successors, (83), 74 states have internal predecessors, (83), 10 states have call successors, (10), 4 states have call predecessors, (10), 23 states have return successors, (56), 32 states have call predecessors, (56), 10 states have call successors, (56) [2022-07-22 17:41:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 149 transitions. [2022-07-22 17:41:51,822 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 149 transitions. Word has length 67 [2022-07-22 17:41:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:51,822 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 149 transitions. [2022-07-22 17:41:51,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.3) internal successors, (92), 35 states have internal predecessors, (92), 17 states have call successors, (20), 1 states have call predecessors, (20), 11 states have return successors, (24), 13 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-22 17:41:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2022-07-22 17:41:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-22 17:41:51,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:51,823 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:41:51,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:52,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-22 17:41:52,047 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1155297274, now seen corresponding path program 14 times [2022-07-22 17:41:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:52,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929055631] [2022-07-22 17:41:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:52,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:52,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:52,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:41:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:52,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:52,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 17:41:52,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:52,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929055631] [2022-07-22 17:41:52,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929055631] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:52,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104139093] [2022-07-22 17:41:52,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:41:52,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:52,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:52,384 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:41:52,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-22 17:41:52,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:41:52,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:52,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-22 17:41:52,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-22 17:41:53,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:41:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 5 proven. 59 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-22 17:41:55,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104139093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:41:55,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:41:55,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 25] total 48 [2022-07-22 17:41:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999784327] [2022-07-22 17:41:55,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:41:55,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-22 17:41:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:41:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-22 17:41:55,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2089, Unknown=0, NotChecked=0, Total=2256 [2022-07-22 17:41:55,594 INFO L87 Difference]: Start difference. First operand 111 states and 149 transitions. Second operand has 48 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 35 states have internal predecessors, (95), 17 states have call successors, (19), 1 states have call predecessors, (19), 13 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2022-07-22 17:41:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:41:56,530 INFO L93 Difference]: Finished difference Result 183 states and 253 transitions. [2022-07-22 17:41:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 17:41:56,531 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 35 states have internal predecessors, (95), 17 states have call successors, (19), 1 states have call predecessors, (19), 13 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) Word has length 67 [2022-07-22 17:41:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:41:56,532 INFO L225 Difference]: With dead ends: 183 [2022-07-22 17:41:56,532 INFO L226 Difference]: Without dead ends: 179 [2022-07-22 17:41:56,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 111 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=396, Invalid=3386, Unknown=0, NotChecked=0, Total=3782 [2022-07-22 17:41:56,533 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 72 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 17:41:56,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 622 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 17:41:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-22 17:41:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 96. [2022-07-22 17:41:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 66 states have internal predecessors, (72), 10 states have call successors, (10), 4 states have call predecessors, (10), 19 states have return successors, (44), 25 states have call predecessors, (44), 10 states have call successors, (44) [2022-07-22 17:41:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2022-07-22 17:41:56,551 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 67 [2022-07-22 17:41:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:41:56,551 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2022-07-22 17:41:56,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 35 states have internal predecessors, (95), 17 states have call successors, (19), 1 states have call predecessors, (19), 13 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2022-07-22 17:41:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2022-07-22 17:41:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-22 17:41:56,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:41:56,552 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 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] [2022-07-22 17:41:56,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-22 17:41:56,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:56,767 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:41:56,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:41:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash -37775706, now seen corresponding path program 15 times [2022-07-22 17:41:56,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:41:56,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296063546] [2022-07-22 17:41:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:41:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:41:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:41:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:56,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:41:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:41:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:57,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:41:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:41:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 17:41:57,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:41:57,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296063546] [2022-07-22 17:41:57,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296063546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:41:57,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034491448] [2022-07-22 17:41:57,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 17:41:57,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:41:57,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:41:57,085 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:41:57,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-22 17:41:57,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 17:41:57,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:41:57,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 17:41:57,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:41:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 17:41:57,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:42:07,860 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 43 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 17:42:09,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034491448] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:09,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:42:09,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2022-07-22 17:42:09,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196045644] [2022-07-22 17:42:09,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:42:09,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 17:42:09,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:42:09,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 17:42:09,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1754, Unknown=1, NotChecked=0, Total=1892 [2022-07-22 17:42:09,137 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 24 states have internal predecessors, (64), 11 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (16), 13 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-22 17:42:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:42:10,302 INFO L93 Difference]: Finished difference Result 172 states and 231 transitions. [2022-07-22 17:42:10,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-22 17:42:10,302 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 24 states have internal predecessors, (64), 11 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (16), 13 states have call predecessors, (16), 11 states have call successors, (16) Word has length 67 [2022-07-22 17:42:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:42:10,304 INFO L225 Difference]: With dead ends: 172 [2022-07-22 17:42:10,304 INFO L226 Difference]: Without dead ends: 168 [2022-07-22 17:42:10,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=377, Invalid=3528, Unknown=1, NotChecked=0, Total=3906 [2022-07-22 17:42:10,305 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 53 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 17:42:10,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 462 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 17:42:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-22 17:42:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 63. [2022-07-22 17:42:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (16), 13 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-22 17:42:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-07-22 17:42:10,312 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 67 [2022-07-22 17:42:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:42:10,313 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-07-22 17:42:10,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 24 states have internal predecessors, (64), 11 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (16), 13 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-22 17:42:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-07-22 17:42:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 17:42:10,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:42:10,314 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:42:10,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-07-22 17:42:10,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:10,535 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:42:10,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:42:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash -835098444, now seen corresponding path program 5 times [2022-07-22 17:42:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:42:10,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584013833] [2022-07-22 17:42:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:42:10,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:42:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:42:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:10,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:42:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:10,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:10,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:10,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 17:42:10,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:42:10,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584013833] [2022-07-22 17:42:10,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584013833] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:10,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733051595] [2022-07-22 17:42:10,832 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 17:42:10,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:42:10,834 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:42:10,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-22 17:42:11,076 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 17:42:11,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:42:11,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-22 17:42:11,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:42:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 17:42:11,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:42:12,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733051595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:12,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:42:12,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 29 [2022-07-22 17:42:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471733104] [2022-07-22 17:42:12,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:42:12,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-22 17:42:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:42:12,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-22 17:42:12,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2022-07-22 17:42:12,560 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 29 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:42:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:42:13,089 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2022-07-22 17:42:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 17:42:13,090 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 58 [2022-07-22 17:42:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:42:13,091 INFO L225 Difference]: With dead ends: 85 [2022-07-22 17:42:13,091 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 17:42:13,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=1747, Unknown=0, NotChecked=0, Total=1980 [2022-07-22 17:42:13,092 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:42:13,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 392 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:42:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 17:42:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-07-22 17:42:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 47 states have internal predecessors, (52), 9 states have call successors, (9), 4 states have call predecessors, (9), 10 states have return successors, (18), 14 states have call predecessors, (18), 9 states have call successors, (18) [2022-07-22 17:42:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-07-22 17:42:13,097 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 58 [2022-07-22 17:42:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:42:13,097 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-07-22 17:42:13,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:42:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-07-22 17:42:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-22 17:42:13,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:42:13,098 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:42:13,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-22 17:42:13,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-22 17:42:13,322 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:42:13,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:42:13,322 INFO L85 PathProgramCache]: Analyzing trace with hash -551668204, now seen corresponding path program 16 times [2022-07-22 17:42:13,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:42:13,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974615810] [2022-07-22 17:42:13,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:42:13,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:42:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:13,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:42:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:13,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:13,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:42:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:13,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 17:42:13,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:42:13,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974615810] [2022-07-22 17:42:13,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974615810] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:13,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286184160] [2022-07-22 17:42:13,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 17:42:13,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:13,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:42:13,606 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:42:13,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-22 17:42:13,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 17:42:13,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:42:13,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-22 17:42:13,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:42:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 17:42:14,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:42:15,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286184160] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:15,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:42:15,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 29 [2022-07-22 17:42:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957814225] [2022-07-22 17:42:15,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:42:15,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-22 17:42:15,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:42:15,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-22 17:42:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2022-07-22 17:42:15,367 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 29 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:42:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:42:15,932 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2022-07-22 17:42:15,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 17:42:15,933 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 58 [2022-07-22 17:42:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:42:15,933 INFO L225 Difference]: With dead ends: 89 [2022-07-22 17:42:15,933 INFO L226 Difference]: Without dead ends: 80 [2022-07-22 17:42:15,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 78 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=1747, Unknown=0, NotChecked=0, Total=1980 [2022-07-22 17:42:15,934 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:42:15,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 435 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:42:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-22 17:42:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2022-07-22 17:42:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.125) internal successors, (54), 49 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 11 states have return successors, (20), 15 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-22 17:42:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2022-07-22 17:42:15,939 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 58 [2022-07-22 17:42:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:42:15,940 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2022-07-22 17:42:15,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 17:42:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2022-07-22 17:42:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 17:42:15,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:42:15,941 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-22 17:42:15,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-07-22 17:42:16,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-22 17:42:16,155 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:42:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:42:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash 590358656, now seen corresponding path program 17 times [2022-07-22 17:42:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:42:16,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837456572] [2022-07-22 17:42:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:42:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:42:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:16,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:42:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:16,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:16,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:16,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:42:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:16,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:16,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 17:42:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:42:16,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837456572] [2022-07-22 17:42:16,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837456572] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:16,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22182674] [2022-07-22 17:42:16,497 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 17:42:16,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:16,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:42:16,500 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:42:16,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-22 17:42:16,820 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 17:42:16,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:42:16,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-22 17:42:16,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:42:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 17:42:17,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:42:20,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22182674] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:20,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:42:20,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31 [2022-07-22 17:42:20,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113680386] [2022-07-22 17:42:20,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:42:20,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-22 17:42:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:42:20,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 17:42:20,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1283, Unknown=1, NotChecked=0, Total=1406 [2022-07-22 17:42:20,961 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 31 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 23 states have internal predecessors, (60), 11 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-22 17:42:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:42:21,626 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-07-22 17:42:21,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 17:42:21,627 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 23 states have internal predecessors, (60), 11 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) Word has length 66 [2022-07-22 17:42:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:42:21,628 INFO L225 Difference]: With dead ends: 90 [2022-07-22 17:42:21,628 INFO L226 Difference]: Without dead ends: 81 [2022-07-22 17:42:21,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 89 SyntacticMatches, 12 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=260, Invalid=2091, Unknown=1, NotChecked=0, Total=2352 [2022-07-22 17:42:21,628 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:42:21,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 529 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:42:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-22 17:42:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2022-07-22 17:42:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 9 states have call successors, (9), 4 states have call predecessors, (9), 12 states have return successors, (22), 15 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-22 17:42:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2022-07-22 17:42:21,633 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 66 [2022-07-22 17:42:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:42:21,633 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2022-07-22 17:42:21,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 23 states have internal predecessors, (60), 11 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-22 17:42:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-07-22 17:42:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 17:42:21,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:42:21,634 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:42:21,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-22 17:42:21,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:21,847 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:42:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:42:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash 720804832, now seen corresponding path program 6 times [2022-07-22 17:42:21,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:42:21,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593203398] [2022-07-22 17:42:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:42:21,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:42:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:42:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:21,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:21,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:21,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:42:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:22,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:22,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:22,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 17:42:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:42:22,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593203398] [2022-07-22 17:42:22,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593203398] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:22,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189063790] [2022-07-22 17:42:22,117 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 17:42:22,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:22,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:42:22,120 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:42:22,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-22 17:42:22,463 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-22 17:42:22,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:42:22,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-22 17:42:22,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:42:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 17:42:22,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:42:25,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189063790] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:25,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:42:25,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2022-07-22 17:42:25,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656292887] [2022-07-22 17:42:25,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:42:25,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 17:42:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:42:25,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 17:42:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=737, Unknown=1, NotChecked=0, Total=812 [2022-07-22 17:42:25,930 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 11 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-22 17:42:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:42:26,401 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-07-22 17:42:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 17:42:26,402 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 11 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) Word has length 66 [2022-07-22 17:42:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:42:26,402 INFO L225 Difference]: With dead ends: 101 [2022-07-22 17:42:26,402 INFO L226 Difference]: Without dead ends: 97 [2022-07-22 17:42:26,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=157, Invalid=1402, Unknown=1, NotChecked=0, Total=1560 [2022-07-22 17:42:26,403 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:42:26,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 466 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 17:42:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-22 17:42:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2022-07-22 17:42:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 10 states have call successors, (10), 4 states have call predecessors, (10), 15 states have return successors, (29), 19 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-22 17:42:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-07-22 17:42:26,408 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 66 [2022-07-22 17:42:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:42:26,408 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-07-22 17:42:26,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 11 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-22 17:42:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-07-22 17:42:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 17:42:26,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:42:26,409 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-22 17:42:26,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-22 17:42:26,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:26,615 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:42:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:42:26,616 INFO L85 PathProgramCache]: Analyzing trace with hash 354934560, now seen corresponding path program 18 times [2022-07-22 17:42:26,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:42:26,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107105288] [2022-07-22 17:42:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:42:26,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:42:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:26,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:42:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:26,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:26,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:42:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:26,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:26,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 17:42:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:42:26,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107105288] [2022-07-22 17:42:26,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107105288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:26,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151229766] [2022-07-22 17:42:26,964 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 17:42:26,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:26,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:42:26,968 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:42:26,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-22 17:42:27,331 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-22 17:42:27,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:42:27,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-22 17:42:27,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:42:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 17:42:27,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:42:30,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151229766] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:30,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:42:30,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31 [2022-07-22 17:42:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166574741] [2022-07-22 17:42:30,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:42:30,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-22 17:42:30,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:42:30,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 17:42:30,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1283, Unknown=1, NotChecked=0, Total=1406 [2022-07-22 17:42:30,305 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 31 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 23 states have internal predecessors, (60), 11 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-22 17:42:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:42:30,954 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-07-22 17:42:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 17:42:30,954 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 23 states have internal predecessors, (60), 11 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) Word has length 66 [2022-07-22 17:42:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:42:30,955 INFO L225 Difference]: With dead ends: 102 [2022-07-22 17:42:30,955 INFO L226 Difference]: Without dead ends: 93 [2022-07-22 17:42:30,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 88 SyntacticMatches, 13 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=260, Invalid=2091, Unknown=1, NotChecked=0, Total=2352 [2022-07-22 17:42:30,956 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:42:30,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 496 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:42:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-22 17:42:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2022-07-22 17:42:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 10 states have call successors, (10), 4 states have call predecessors, (10), 15 states have return successors, (29), 19 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-22 17:42:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-07-22 17:42:30,962 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 66 [2022-07-22 17:42:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:42:30,962 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-07-22 17:42:30,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 23 states have internal predecessors, (60), 11 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-22 17:42:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-07-22 17:42:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 17:42:30,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:42:30,963 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-22 17:42:30,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-22 17:42:31,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:31,188 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:42:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:42:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash 485380736, now seen corresponding path program 19 times [2022-07-22 17:42:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:42:31,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83631197] [2022-07-22 17:42:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:42:31,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:42:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:42:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:31,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:31,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:31,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:42:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:31,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:31,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 17:42:31,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:42:31,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83631197] [2022-07-22 17:42:31,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83631197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:31,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725048790] [2022-07-22 17:42:31,508 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 17:42:31,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:31,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:42:31,510 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:42:31,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-22 17:42:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:31,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 17:42:31,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:42:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-22 17:42:34,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:42:36,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725048790] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:36,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:42:36,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 33 [2022-07-22 17:42:36,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008762621] [2022-07-22 17:42:36,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:42:36,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 17:42:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:42:36,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 17:42:36,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1590, Unknown=0, NotChecked=0, Total=1722 [2022-07-22 17:42:36,530 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 33 states, 30 states have (on average 2.1) internal successors, (63), 25 states have internal predecessors, (63), 10 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-07-22 17:42:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:42:37,315 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2022-07-22 17:42:37,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 17:42:37,315 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.1) internal successors, (63), 25 states have internal predecessors, (63), 10 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) Word has length 66 [2022-07-22 17:42:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:42:37,316 INFO L225 Difference]: With dead ends: 129 [2022-07-22 17:42:37,316 INFO L226 Difference]: Without dead ends: 125 [2022-07-22 17:42:37,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=303, Invalid=2667, Unknown=0, NotChecked=0, Total=2970 [2022-07-22 17:42:37,317 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 52 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:42:37,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 506 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 544 Invalid, 0 Unknown, 138 Unchecked, 0.3s Time] [2022-07-22 17:42:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-22 17:42:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 96. [2022-07-22 17:42:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 66 states have internal predecessors, (72), 10 states have call successors, (10), 4 states have call predecessors, (10), 19 states have return successors, (40), 25 states have call predecessors, (40), 10 states have call successors, (40) [2022-07-22 17:42:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2022-07-22 17:42:37,326 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 66 [2022-07-22 17:42:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:42:37,326 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2022-07-22 17:42:37,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.1) internal successors, (63), 25 states have internal predecessors, (63), 10 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-07-22 17:42:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2022-07-22 17:42:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 17:42:37,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:42:37,328 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-22 17:42:37,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-22 17:42:37,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-22 17:42:37,551 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:42:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:42:37,552 INFO L85 PathProgramCache]: Analyzing trace with hash 959666752, now seen corresponding path program 20 times [2022-07-22 17:42:37,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:42:37,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819128182] [2022-07-22 17:42:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:42:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:42:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:37,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:42:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:37,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:37,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:37,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:42:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:37,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 29 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-22 17:42:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:42:37,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819128182] [2022-07-22 17:42:37,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819128182] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:37,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823219415] [2022-07-22 17:42:37,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:42:37,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:37,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:42:37,860 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:42:37,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-22 17:42:38,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:42:38,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:42:38,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 17:42:38,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:42:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 17:42:43,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:42:46,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823219415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:46,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:42:46,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 33 [2022-07-22 17:42:46,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010873229] [2022-07-22 17:42:46,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:42:46,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 17:42:46,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:42:46,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 17:42:46,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1504, Unknown=3, NotChecked=0, Total=1640 [2022-07-22 17:42:46,616 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand has 33 states, 29 states have (on average 2.103448275862069) internal successors, (61), 25 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-22 17:42:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:42:47,506 INFO L93 Difference]: Finished difference Result 147 states and 191 transitions. [2022-07-22 17:42:47,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 17:42:47,506 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 2.103448275862069) internal successors, (61), 25 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) Word has length 66 [2022-07-22 17:42:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:42:47,507 INFO L225 Difference]: With dead ends: 147 [2022-07-22 17:42:47,508 INFO L226 Difference]: Without dead ends: 143 [2022-07-22 17:42:47,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 87 SyntacticMatches, 14 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=335, Invalid=2742, Unknown=3, NotChecked=0, Total=3080 [2022-07-22 17:42:47,509 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:42:47,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 450 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 528 Invalid, 0 Unknown, 44 Unchecked, 0.3s Time] [2022-07-22 17:42:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-22 17:42:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 99. [2022-07-22 17:42:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 10 states have call successors, (10), 4 states have call predecessors, (10), 20 states have return successors, (43), 26 states have call predecessors, (43), 10 states have call successors, (43) [2022-07-22 17:42:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2022-07-22 17:42:47,518 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 66 [2022-07-22 17:42:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:42:47,519 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2022-07-22 17:42:47,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 2.103448275862069) internal successors, (61), 25 states have internal predecessors, (61), 11 states have call successors, (11), 1 states have call predecessors, (11), 12 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-22 17:42:47,519 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2022-07-22 17:42:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 17:42:47,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:42:47,520 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-22 17:42:47,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-22 17:42:47,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-22 17:42:47,743 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:42:47,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:42:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash 724242656, now seen corresponding path program 21 times [2022-07-22 17:42:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:42:47,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649190134] [2022-07-22 17:42:47,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:42:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:42:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:47,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:42:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:47,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:47,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:42:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:47,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 17:42:48,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:42:48,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649190134] [2022-07-22 17:42:48,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649190134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:48,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018944690] [2022-07-22 17:42:48,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 17:42:48,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:48,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:42:48,013 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:42:48,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-22 17:42:48,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 17:42:48,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:42:48,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-22 17:42:48,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:42:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 17:42:48,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:42:53,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018944690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:53,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:42:53,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2022-07-22 17:42:53,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162838012] [2022-07-22 17:42:53,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:42:53,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 17:42:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:42:53,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 17:42:53,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=737, Unknown=1, NotChecked=0, Total=812 [2022-07-22 17:42:53,301 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 11 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-22 17:42:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:42:53,907 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2022-07-22 17:42:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 17:42:53,907 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 11 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) Word has length 66 [2022-07-22 17:42:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:42:53,908 INFO L225 Difference]: With dead ends: 127 [2022-07-22 17:42:53,908 INFO L226 Difference]: Without dead ends: 123 [2022-07-22 17:42:53,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=157, Invalid=1402, Unknown=1, NotChecked=0, Total=1560 [2022-07-22 17:42:53,909 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:42:53,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 555 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:42:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-22 17:42:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 103. [2022-07-22 17:42:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 70 states have internal predecessors, (77), 10 states have call successors, (10), 4 states have call predecessors, (10), 21 states have return successors, (45), 28 states have call predecessors, (45), 10 states have call successors, (45) [2022-07-22 17:42:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2022-07-22 17:42:53,917 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 66 [2022-07-22 17:42:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:42:53,918 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2022-07-22 17:42:53,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 11 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-22 17:42:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2022-07-22 17:42:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 17:42:53,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:42:53,919 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:42:53,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-22 17:42:54,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-22 17:42:54,139 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:42:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:42:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1898709812, now seen corresponding path program 7 times [2022-07-22 17:42:54,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:42:54,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983088531] [2022-07-22 17:42:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:42:54,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:42:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:42:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:42:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-22 17:42:54,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:42:54,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983088531] [2022-07-22 17:42:54,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983088531] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:54,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999475739] [2022-07-22 17:42:54,512 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 17:42:54,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:54,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:42:54,516 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:42:54,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-22 17:42:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:54,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-22 17:42:54,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:42:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-22 17:42:55,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:42:58,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999475739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:58,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:42:58,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2022-07-22 17:42:58,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915717726] [2022-07-22 17:42:58,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:42:58,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-22 17:42:58,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:42:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-22 17:42:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1165, Unknown=1, NotChecked=0, Total=1260 [2022-07-22 17:42:58,154 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 24 states have internal predecessors, (64), 10 states have call successors, (10), 1 states have call predecessors, (10), 13 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-07-22 17:42:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:42:59,046 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2022-07-22 17:42:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 17:42:59,047 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 24 states have internal predecessors, (64), 10 states have call successors, (10), 1 states have call predecessors, (10), 13 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) Word has length 74 [2022-07-22 17:42:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:42:59,048 INFO L225 Difference]: With dead ends: 133 [2022-07-22 17:42:59,048 INFO L226 Difference]: Without dead ends: 129 [2022-07-22 17:42:59,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 78 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=251, Invalid=2100, Unknown=1, NotChecked=0, Total=2352 [2022-07-22 17:42:59,049 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 17:42:59,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 635 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 17:42:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-22 17:42:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 97. [2022-07-22 17:42:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 66 states have internal predecessors, (73), 10 states have call successors, (10), 4 states have call predecessors, (10), 19 states have return successors, (39), 26 states have call predecessors, (39), 10 states have call successors, (39) [2022-07-22 17:42:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2022-07-22 17:42:59,057 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 74 [2022-07-22 17:42:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:42:59,058 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2022-07-22 17:42:59,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 24 states have internal predecessors, (64), 10 states have call successors, (10), 1 states have call predecessors, (10), 13 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2022-07-22 17:42:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2022-07-22 17:42:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 17:42:59,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:42:59,059 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:42:59,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-22 17:42:59,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-22 17:42:59,275 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:42:59,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:42:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash -599965996, now seen corresponding path program 22 times [2022-07-22 17:42:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:42:59,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401234516] [2022-07-22 17:42:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:42:59,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:42:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:59,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:42:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:59,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:59,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:42:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:42:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:59,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:42:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:42:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 17:42:59,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:42:59,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401234516] [2022-07-22 17:42:59,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401234516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:42:59,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668003875] [2022-07-22 17:42:59,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 17:42:59,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:42:59,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:42:59,575 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:42:59,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-22 17:42:59,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 17:42:59,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:42:59,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-22 17:42:59,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:43:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-22 17:43:00,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:43:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 17:43:03,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668003875] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:43:03,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:43:03,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 24] total 35 [2022-07-22 17:43:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961077274] [2022-07-22 17:43:03,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:43:03,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-22 17:43:03,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:43:03,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-22 17:43:03,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1090, Unknown=0, NotChecked=0, Total=1190 [2022-07-22 17:43:03,069 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand has 35 states, 34 states have (on average 2.5) internal successors, (85), 28 states have internal predecessors, (85), 14 states have call successors, (17), 1 states have call predecessors, (17), 11 states have return successors, (23), 11 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-22 17:43:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:43:03,632 INFO L93 Difference]: Finished difference Result 131 states and 165 transitions. [2022-07-22 17:43:03,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 17:43:03,632 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5) internal successors, (85), 28 states have internal predecessors, (85), 14 states have call successors, (17), 1 states have call predecessors, (17), 11 states have return successors, (23), 11 states have call predecessors, (23), 14 states have call successors, (23) Word has length 74 [2022-07-22 17:43:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:43:03,633 INFO L225 Difference]: With dead ends: 131 [2022-07-22 17:43:03,633 INFO L226 Difference]: Without dead ends: 127 [2022-07-22 17:43:03,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 124 SyntacticMatches, 24 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2022-07-22 17:43:03,634 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 52 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:43:03,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 517 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:43:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-22 17:43:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2022-07-22 17:43:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 73 states have (on average 1.082191780821918) internal successors, (79), 70 states have internal predecessors, (79), 10 states have call successors, (10), 4 states have call predecessors, (10), 21 states have return successors, (45), 30 states have call predecessors, (45), 10 states have call successors, (45) [2022-07-22 17:43:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 134 transitions. [2022-07-22 17:43:03,643 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 134 transitions. Word has length 74 [2022-07-22 17:43:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:43:03,643 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 134 transitions. [2022-07-22 17:43:03,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5) internal successors, (85), 28 states have internal predecessors, (85), 14 states have call successors, (17), 1 states have call predecessors, (17), 11 states have return successors, (23), 11 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-22 17:43:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 134 transitions. [2022-07-22 17:43:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 17:43:03,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:43:03,645 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:43:03,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-07-22 17:43:03,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:43:03,867 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:43:03,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:43:03,868 INFO L85 PathProgramCache]: Analyzing trace with hash -437615564, now seen corresponding path program 23 times [2022-07-22 17:43:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:43:03,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143027180] [2022-07-22 17:43:03,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:43:03,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:43:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:03,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:43:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:03,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:43:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:43:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:43:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:04,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:43:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:04,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:43:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:43:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:43:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:04,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:43:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 45 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-22 17:43:04,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:43:04,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143027180] [2022-07-22 17:43:04,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143027180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:43:04,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206145627] [2022-07-22 17:43:04,181 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 17:43:04,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:43:04,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:43:04,182 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:43:04,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-22 17:43:04,543 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-22 17:43:04,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:43:04,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-22 17:43:04,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:43:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-22 17:43:08,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:43:13,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206145627] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:43:13,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:43:13,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2022-07-22 17:43:13,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633919254] [2022-07-22 17:43:13,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:43:13,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-22 17:43:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:43:13,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-22 17:43:13,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1367, Unknown=4, NotChecked=0, Total=1482 [2022-07-22 17:43:13,971 INFO L87 Difference]: Start difference. First operand 105 states and 134 transitions. Second operand has 35 states, 32 states have (on average 2.09375) internal successors, (67), 25 states have internal predecessors, (67), 10 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-07-22 17:43:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:43:14,923 INFO L93 Difference]: Finished difference Result 158 states and 209 transitions. [2022-07-22 17:43:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 17:43:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.09375) internal successors, (67), 25 states have internal predecessors, (67), 10 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) Word has length 74 [2022-07-22 17:43:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:43:14,924 INFO L225 Difference]: With dead ends: 158 [2022-07-22 17:43:14,924 INFO L226 Difference]: Without dead ends: 154 [2022-07-22 17:43:14,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=298, Invalid=2560, Unknown=4, NotChecked=0, Total=2862 [2022-07-22 17:43:14,925 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:43:14,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 563 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 590 Invalid, 0 Unknown, 156 Unchecked, 0.3s Time] [2022-07-22 17:43:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-22 17:43:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 112. [2022-07-22 17:43:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 74 states have internal predecessors, (84), 10 states have call successors, (10), 4 states have call predecessors, (10), 23 states have return successors, (51), 33 states have call predecessors, (51), 10 states have call successors, (51) [2022-07-22 17:43:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 145 transitions. [2022-07-22 17:43:14,934 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 145 transitions. Word has length 74 [2022-07-22 17:43:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:43:14,934 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 145 transitions. [2022-07-22 17:43:14,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.09375) internal successors, (67), 25 states have internal predecessors, (67), 10 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-07-22 17:43:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2022-07-22 17:43:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 17:43:14,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:43:14,936 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:43:14,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-07-22 17:43:15,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-07-22 17:43:15,160 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:43:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:43:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1410533388, now seen corresponding path program 24 times [2022-07-22 17:43:15,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:43:15,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363829967] [2022-07-22 17:43:15,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:43:15,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:43:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:15,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 17:43:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:43:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:15,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:43:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:15,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:43:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 17:43:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:43:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:43:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:15,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:43:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:15,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:43:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:43:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 11 proven. 47 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-22 17:43:15,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:43:15,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363829967] [2022-07-22 17:43:15,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363829967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:43:15,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291070996] [2022-07-22 17:43:15,534 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 17:43:15,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:43:15,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:43:15,535 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:43:15,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-22 17:43:15,904 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-22 17:43:15,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:43:15,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-22 17:43:15,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:43:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 14 proven. 44 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-22 17:43:18,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:43:27,932 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3) (forall ((aux_div_v_gcd_~y1_BEFORE_CALL_140_47 Int)) (or (forall ((|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (aux_div_aux_mod_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_178 Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse5 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse6 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2))) (let ((.cse0 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_47 2)) (.cse1 (* aux_div_aux_mod_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_178 2)) (.cse3 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse2 (+ .cse5 9 .cse6)) (.cse4 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3))) (or (<= (+ .cse0 .cse1) .cse2) (<= (+ .cse3 2 |c_gcd_#res|) (+ |c_gcd_#in~y1| .cse1)) (<= (+ .cse0 2 .cse1) .cse4) (< (+ 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) aux_div_v_gcd_~y1_BEFORE_CALL_140_47) (<= (+ .cse3 |c_gcd_#res|) .cse2) (<= (+ 7 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (+ aux_div_aux_mod_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_178 aux_div_v_gcd_~y1_BEFORE_CALL_140_47)) (<= (+ .cse5 .cse6 13) .cse4) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= (+ aux_div_aux_mod_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_178 2) aux_div_v_gcd_~y1_BEFORE_CALL_140_47))))) (< (* aux_div_v_gcd_~y1_BEFORE_CALL_140_47 2) |c_gcd_#in~y1|))))) (forall ((aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (or (<= (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3) (+ (* aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 2) 2 (div |c_gcd_#in~y2| 2))) (forall ((|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (let ((.cse14 (* aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 2)) (.cse15 (div |c_gcd_#in~y2| 2)) (.cse10 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2))) (let ((.cse11 (+ .cse10 |c_gcd_#res|)) (.cse9 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse8 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3)) (.cse7 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3)) (.cse12 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse13 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6)) (.cse16 (+ .cse14 .cse15))) (or (<= (+ .cse7 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 1) .cse8) (<= .cse9 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (<= (+ 5 .cse10 |c_gcd_#res|) .cse9) (<= .cse11 (+ .cse12 .cse13 9)) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= (+ .cse12 .cse13 16) .cse9) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (< .cse9 (+ .cse12 .cse13 12)) (<= (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| .cse14) (+ .cse12 .cse13 5)) (< (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 2) .cse15) (<= .cse11 .cse16) (<= (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| .cse14 9) .cse9) (<= (+ .cse8 3) (+ .cse7 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (<= (+ .cse12 .cse13 11) .cse16))))) (< (+ aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|))) (forall ((aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127 Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (or (< (+ aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (forall ((|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (let ((.cse18 (+ (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse22 (div (+ 7 |c_gcd_#in~y1|) (- 2))) (.cse20 (* 2 aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127)) (.cse21 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse19 (+ (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3) |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 1)) (.cse17 (* |aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| 3)) (.cse25 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse23 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse24 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= (+ 3 .cse17) .cse18) (<= .cse19 .cse18) (<= (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 9 .cse20) .cse21) (<= |c_gcd_#res| (+ |aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| 2)) (<= (+ .cse22 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 7) 0) (<= (+ 16 .cse23 .cse24) .cse21) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3) (<= .cse20 (+ .cse25 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 5) 5)) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (<= (+ .cse22 15 .cse23 .cse24) .cse20) (< .cse21 (+ 12 .cse23 .cse24)) (<= .cse19 .cse17) (<= (+ .cse25 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6) 2) (+ .cse23 .cse24))))) (<= (+ (div (+ 7 |c_gcd_#in~y1|) (- 2)) (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3) 2) (* 2 aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127)))) (forall ((|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (or (forall ((|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115 Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (let ((.cse31 (div (+ 7 |c_gcd_#in~y1|) (- 2))) (.cse32 (* 2 aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115)) (.cse30 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse28 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse29 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6)) (.cse26 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse27 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= (+ 2 .cse26 .cse27) (+ .cse28 .cse29)) (<= |c_gcd_#res| (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 2)) (< (+ aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3) (<= (+ .cse28 .cse29 16) .cse30) (< (+ .cse31 .cse30 1) .cse32) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (<= (+ .cse31 15 .cse26 .cse27) .cse32) (< .cse30 (+ 12 .cse26 .cse27)) (<= (+ .cse28 .cse29 2) (+ .cse26 .cse27))))) (< (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 2) (div |c_gcd_#in~y2| 2)))) (forall ((aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162 Int)) (or (< (+ 2 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162) |c_gcd_#in~y1|) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (forall ((aux_div_v_gcd_~y1_BEFORE_CALL_140_47 Int)) (let ((.cse33 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_47 2))) (or (<= (+ 5 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162) .cse33) (< .cse33 |c_gcd_#in~y1|) (forall ((|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse40 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_47 2)) (.cse41 (* 2 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162)) (.cse37 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse38 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2))) (let ((.cse35 (+ .cse37 9 .cse38)) (.cse39 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (.cse36 (+ .cse40 .cse41)) (.cse34 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2))) (or (< (+ 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) aux_div_v_gcd_~y1_BEFORE_CALL_140_47) (<= (+ .cse34 |c_gcd_#res|) .cse35) (<= .cse36 .cse35) (<= (+ .cse37 .cse38 13) .cse39) (<= (* 3 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162) (+ 7 .cse37 .cse38)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= (+ .cse40 2 .cse41) .cse39) (<= (+ .cse37 14 .cse38) .cse36) (<= (+ .cse34 2 |c_gcd_#res|) (+ |c_gcd_#in~y1| .cse41))))))))) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))))) (forall ((aux_div_v_gcd_~y2_BEFORE_CALL_88_139 Int)) (or (< (+ aux_div_v_gcd_~y2_BEFORE_CALL_88_139 1) |c_gcd_#in~y2|) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (let ((.cse42 (* 6 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (.cse43 (* |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 2)) (.cse45 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse44 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))) (or (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 3) (<= (+ .cse42 .cse43 12) (+ (* aux_div_v_gcd_~y2_BEFORE_CALL_88_139 2) |c_gcd_#in~y2|)) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ .cse44 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 1) .cse45) (<= (* aux_div_v_gcd_~y2_BEFORE_CALL_88_139 3) (+ .cse42 .cse43 7)) (<= (+ 3 .cse45) (+ .cse44 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div (+ (- 1) |c_gcd_#in~y1|) 2))))))) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (let ((.cse47 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|))) (let ((.cse48 (div |c_gcd_#in~y2| 2)) (.cse46 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (.cse49 (+ 3 .cse47))) (or (<= (+ .cse46 3) .cse47) (<= (+ 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) .cse48) (<= .cse49 .cse46) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ .cse47 8) (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 .cse48)) (<= (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 1) .cse48) (<= (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (+ .cse46 1)) (<= (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 2) .cse49))))) (forall ((aux_div_v_gcd_~y1_BEFORE_CALL_140_114 Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (let ((.cse50 (* 6 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (.cse51 (* |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 2)) (.cse53 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse52 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))) (or (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div |c_gcd_#in~y2| 2)) (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 3) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|) (<= (* 3 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) (+ .cse50 .cse51 7)) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ .cse50 .cse51 13) (+ (* 2 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) |c_gcd_#in~y1|)) (< (+ 2 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) |c_gcd_#in~y1|) (<= (+ .cse52 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 1) .cse53) (<= (+ 3 .cse53) (+ .cse52 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))))) (forall ((|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (or (forall ((aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114 Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (let ((.cse54 (div (+ |c_gcd_#in~y2| 8) (- 2))) (.cse56 (* 2 aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114)) (.cse55 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse57 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse58 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse59 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= (+ .cse54 .cse55 |c_gcd_#res| 4) .cse56) (<= .cse57 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (< (+ aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (<= (+ 16 .cse58 .cse59) .cse57) (< |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 0) (<= (+ 5 .cse55 |c_gcd_#res|) .cse57) (<= (+ .cse54 15 .cse58 .cse59) .cse56) (< (+ .cse57 .cse54 1) .cse56) (<= (+ .cse55 |c_gcd_#res|) (+ 9 .cse58 .cse59)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (< .cse57 (+ 12 .cse58 .cse59)) (<= 3 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)))) (< (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 2) (div (+ (- 1) |c_gcd_#in~y1|) 2)))) (forall ((|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (or (< (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 2) (div |c_gcd_#in~y2| 2)) (forall ((aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115 Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (let ((.cse63 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse64 (div (+ 7 |c_gcd_#in~y1|) (- 2))) (.cse65 (* 2 aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115)) (.cse60 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse61 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse62 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= .cse60 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (<= (+ 16 .cse61 .cse62) .cse60) (< |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 0) (<= (+ 5 .cse63 |c_gcd_#res|) .cse60) (< (+ aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (<= (+ .cse64 .cse63 |c_gcd_#res| 4) .cse65) (<= (+ .cse63 |c_gcd_#res|) (+ 9 .cse61 .cse62)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (< (+ .cse64 .cse60 1) .cse65) (<= (+ .cse64 15 .cse61 .cse62) .cse65) (< .cse60 (+ 12 .cse61 .cse62)) (<= 3 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)))))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (forall ((aux_div_v_gcd_~y1_BEFORE_CALL_140_53 Int)) (or (< 0 (+ |c_gcd_#in~y1| 6 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_53 2))) (forall ((aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_53_154 Int)) (or (forall ((|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse67 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (.cse71 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse66 (* 2 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_53_154)) (.cse69 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse70 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2)) (.cse68 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_53 2))) (or (<= .cse66 (+ .cse67 .cse68 4)) (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div |c_gcd_#in~y2| 2)) (<= (+ .cse69 .cse70 20 .cse68) .cse66) (<= (+ .cse71 |c_gcd_#res|) (+ .cse69 9 .cse70)) (<= (+ .cse69 .cse70 13) .cse67) (<= (+ .cse71 2 |c_gcd_#res|) (+ |c_gcd_#in~y1| .cse66)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= .cse66 (+ .cse69 15 .cse70 .cse68))))) (< (+ aux_div_v_gcd_~y1_BEFORE_CALL_140_53 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_53_154 4) 0))))) (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int) (aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162 Int)) (let ((.cse73 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse72 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))) (or (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 3) (< (+ 2 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162) |c_gcd_#in~y1|) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ .cse72 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 1) .cse73) (<= (* 3 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162) (+ (* 6 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|) (* |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 2) 7)) (<= (+ .cse72 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 6) (+ aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162 (div (+ (- 1) |c_gcd_#in~y1|) 2))) (<= (+ 3 .cse73) (+ .cse72 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))))) (forall ((aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101 Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (let ((.cse75 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse74 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))) (or (<= (+ .cse74 3) .cse75) (<= (+ 3 .cse75) .cse74) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ 7 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101) 0) (<= (+ .cse74 16 (* 2 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101)) 0) (<= 0 (+ 3 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101 (div (+ (- 1) |c_gcd_#in~y1|) 2)))))) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (aux_div_v_gcd_~y1_BEFORE_CALL_140_53 Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (let ((.cse76 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (.cse77 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse78 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_53 2))) (or (<= (+ .cse76 3) .cse77) (< 0 (+ |c_gcd_#in~y1| 6 .cse78)) (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div |c_gcd_#in~y2| 2)) (<= (+ 3 .cse77) .cse76) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ 16 .cse77 .cse78) 0)))) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int) (aux_div_v_gcd_~y2_BEFORE_CALL_88_78 Int)) (let ((.cse79 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (.cse81 (* 2 aux_div_v_gcd_~y2_BEFORE_CALL_88_78)) (.cse80 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|))) (or (<= (+ .cse79 3) .cse80) (<= (+ 3 .cse80) .cse79) (< 0 (+ 7 .cse81 |c_gcd_#in~y2|)) (<= (+ .cse81 16 .cse80) 0) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div (+ (- 1) |c_gcd_#in~y1|) 2))))) (forall ((aux_div_v_gcd_~y2_BEFORE_CALL_88_139 Int)) (or (< (+ aux_div_v_gcd_~y2_BEFORE_CALL_88_139 1) |c_gcd_#in~y2|) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (forall ((|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse82 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse84 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse85 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2)) (.cse83 (+ (* aux_div_v_gcd_~y2_BEFORE_CALL_88_139 2) |c_gcd_#in~y2|))) (or (<= (+ .cse82 |c_gcd_#res| 1) .cse83) (<= (+ .cse82 |c_gcd_#res|) (+ .cse84 9 .cse85)) (<= (+ .cse84 .cse85 13) (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= (* aux_div_v_gcd_~y2_BEFORE_CALL_88_139 3) (+ 7 .cse84 .cse85)) (<= (+ .cse84 .cse85 12) .cse83) (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div (+ (- 1) |c_gcd_#in~y1|) 2))))) (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3) (forall ((aux_div_v_gcd_~y2_BEFORE_CALL_88_78 Int)) (or (forall ((aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_78_152 Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse91 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (.cse90 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse89 (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_78_152 2)) (.cse86 (* 2 aux_div_v_gcd_~y2_BEFORE_CALL_88_78)) (.cse87 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse88 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2))) (or (<= (+ .cse86 .cse87 .cse88 20) .cse89) (<= (+ .cse90 |c_gcd_#res|) (+ .cse87 9 .cse88)) (<= .cse89 (+ .cse91 .cse86 4)) (<= (+ .cse87 .cse88 13) .cse91) (< (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_78_152 aux_div_v_gcd_~y2_BEFORE_CALL_88_78 4) 0) (<= (+ .cse90 |c_gcd_#res| 1) (+ |c_gcd_#in~y2| .cse89)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= .cse89 (+ .cse86 .cse87 15 .cse88)) (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div (+ (- 1) |c_gcd_#in~y1|) 2))))) (< 0 (+ 7 (* 2 aux_div_v_gcd_~y2_BEFORE_CALL_88_78) |c_gcd_#in~y2|)))))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (forall ((aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 Int)) (or (forall ((aux_div_v_gcd_~y2_BEFORE_CALL_88_82 Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse92 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse93 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2)) (.cse95 (* 2 aux_div_v_gcd_~y2_BEFORE_CALL_88_82)) (.cse96 (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 2))) (let ((.cse94 (+ .cse95 .cse96)) (.cse99 (+ .cse92 9 .cse93)) (.cse98 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse97 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3))) (or (<= (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 3) (+ 7 .cse92 .cse93)) (<= (+ .cse92 14 .cse93) .cse94) (<= (+ 2 .cse95 .cse96) .cse97) (<= (+ .cse98 |c_gcd_#res|) .cse99) (<= .cse94 .cse99) (<= (+ .cse98 |c_gcd_#res| 1) (+ .cse96 |c_gcd_#in~y2|)) (< (+ 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) aux_div_v_gcd_~y2_BEFORE_CALL_88_82) (<= (+ .cse92 .cse93 13) .cse97) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (< .cse95 (+ |c_gcd_#in~y2| 1)))))) (< (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 1) |c_gcd_#in~y2|))) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))) (forall ((|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (or (forall ((aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114 Int) (|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (let ((.cse105 (div (+ |c_gcd_#in~y2| 8) (- 2))) (.cse106 (* 2 aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114)) (.cse104 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse102 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse103 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6)) (.cse100 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse101 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= (+ 2 .cse100 .cse101) (+ .cse102 .cse103)) (<= |c_gcd_#res| (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 2)) (< (+ aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|) (< (+ .cse104 .cse105 1) .cse106) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3) (<= (+ .cse102 .cse103 16) .cse104) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (<= (+ .cse102 .cse103 .cse105 15) .cse106) (< .cse104 (+ 12 .cse100 .cse101)) (<= (+ .cse102 .cse103 2) (+ .cse100 .cse101))))) (< (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 2) (div (+ (- 1) |c_gcd_#in~y1|) 2)))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (forall ((aux_div_v_gcd_~y1_BEFORE_CALL_140_114 Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse107 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse108 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2))) (let ((.cse109 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse111 (+ .cse107 .cse108 13)) (.cse110 (+ (* 2 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) |c_gcd_#in~y1|))) (or (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div |c_gcd_#in~y2| 2)) (<= (* 3 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) (+ 7 .cse107 .cse108)) (<= (+ .cse109 2 |c_gcd_#res|) .cse110) (<= (+ .cse109 |c_gcd_#res|) (+ .cse107 9 .cse108)) (<= .cse111 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (< (+ 2 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) |c_gcd_#in~y1|) (<= .cse111 .cse110))))) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))) (forall ((aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (or (<= (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3) (+ (* aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 2) 2 (div |c_gcd_#in~y2| 2))) (forall ((|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (let ((.cse113 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3)) (.cse117 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse114 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3)) (.cse112 (* |aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| 3)) (.cse115 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse116 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6)) (.cse118 (* aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 2)) (.cse119 (div |c_gcd_#in~y2| 2))) (or (<= (+ 3 .cse112) (+ .cse113 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (<= (+ .cse113 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 1) .cse114) (<= |c_gcd_#res| (+ |aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| 2)) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (<= (+ .cse115 .cse116 16) .cse117) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (< .cse117 (+ .cse115 .cse116 12)) (<= (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| .cse118) (+ .cse115 .cse116 5)) (< (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 2) .cse119) (<= (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| .cse118 9) .cse117) (<= (+ .cse114 3) .cse112) (<= (+ .cse115 .cse116 11) (+ .cse118 .cse119))))) (< (+ aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (let ((.cse120 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse121 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))) (or (<= (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 3) (+ 7 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2))) (<= (+ |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 6 .cse120) (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 (div |c_gcd_#in~y2| 2))) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (< (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 1) |c_gcd_#in~y2|) (<= (+ .cse121 3) (+ |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| .cse120)) (<= (+ |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| .cse120 1) .cse121)))) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))) (forall ((aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127 Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (or (< (+ aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (<= (+ (div (+ 7 |c_gcd_#in~y1|) (- 2)) (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3) 2) (* 2 aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127)) (forall ((|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (let ((.cse123 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse122 (div (+ 7 |c_gcd_#in~y1|) (- 2))) (.cse124 (* 2 aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127)) (.cse125 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse128 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse129 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6)) (.cse126 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse127 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= (+ .cse122 .cse123 |c_gcd_#res| 4) .cse124) (<= .cse125 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (<= (+ 2 .cse126 .cse127) (+ .cse128 .cse129)) (<= (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 9 .cse124) .cse125) (<= (+ .cse122 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 7) 0) (<= (+ 16 .cse126 .cse127) .cse125) (<= (+ 5 .cse123 |c_gcd_#res|) .cse125) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|) (<= (+ .cse123 |c_gcd_#res|) (+ .cse128 .cse129 9)) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= .cse124 (+ .cse128 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 5) 5)) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (<= (+ .cse122 15 .cse126 .cse127) .cse124) (< .cse125 (+ 12 .cse126 .cse127)) (<= (+ .cse128 .cse129 2) (+ .cse126 .cse127))))))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (forall ((aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 Int) (aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 Int)) (or (< (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 4) 0) (<= 0 (+ aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 3 (div |c_gcd_#in~y2| 2))) (forall ((|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse133 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse130 (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 2)) (.cse132 (* aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 2)) (.cse134 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse135 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2)) (.cse131 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3))) (or (<= (+ aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) 10) aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160) (<= .cse130 (+ .cse131 .cse132 4)) (<= (+ .cse133 |c_gcd_#res|) (+ .cse134 9 .cse135)) (<= (+ .cse133 |c_gcd_#res| 1) (+ .cse130 |c_gcd_#in~y2|)) (<= .cse130 (+ .cse132 .cse134 15 .cse135)) (<= (+ .cse134 .cse135 13) .cse131) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= (+ aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 7 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) 0)))))) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3)))) is different from false [2022-07-22 17:43:31,043 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3) (forall ((aux_div_v_gcd_~y1_BEFORE_CALL_140_47 Int)) (or (forall ((|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (aux_div_aux_mod_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_178 Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse5 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse6 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2))) (let ((.cse0 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_47 2)) (.cse1 (* aux_div_aux_mod_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_178 2)) (.cse3 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse2 (+ .cse5 9 .cse6)) (.cse4 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3))) (or (<= (+ .cse0 .cse1) .cse2) (<= (+ .cse3 2 |c_gcd_#res|) (+ |c_gcd_#in~y1| .cse1)) (<= (+ .cse0 2 .cse1) .cse4) (< (+ 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) aux_div_v_gcd_~y1_BEFORE_CALL_140_47) (<= (+ .cse3 |c_gcd_#res|) .cse2) (<= (+ 7 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (+ aux_div_aux_mod_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_178 aux_div_v_gcd_~y1_BEFORE_CALL_140_47)) (<= (+ .cse5 .cse6 13) .cse4) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= (+ aux_div_aux_mod_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_178 2) aux_div_v_gcd_~y1_BEFORE_CALL_140_47))))) (< (* aux_div_v_gcd_~y1_BEFORE_CALL_140_47 2) |c_gcd_#in~y1|))))) (forall ((aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (or (<= (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3) (+ (* aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 2) 2 (div |c_gcd_#in~y2| 2))) (forall ((|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (let ((.cse14 (* aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 2)) (.cse15 (div |c_gcd_#in~y2| 2)) (.cse10 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2))) (let ((.cse11 (+ .cse10 |c_gcd_#res|)) (.cse9 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse8 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3)) (.cse7 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3)) (.cse12 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse13 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6)) (.cse16 (+ .cse14 .cse15))) (or (<= (+ .cse7 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 1) .cse8) (<= .cse9 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (<= (+ 5 .cse10 |c_gcd_#res|) .cse9) (<= .cse11 (+ .cse12 .cse13 9)) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= (+ .cse12 .cse13 16) .cse9) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (< .cse9 (+ .cse12 .cse13 12)) (<= (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| .cse14) (+ .cse12 .cse13 5)) (< (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 2) .cse15) (<= .cse11 .cse16) (<= (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| .cse14 9) .cse9) (<= (+ .cse8 3) (+ .cse7 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (<= (+ .cse12 .cse13 11) .cse16))))) (< (+ aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|))) (forall ((aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127 Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (or (< (+ aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (forall ((|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (let ((.cse18 (+ (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse22 (div (+ 7 |c_gcd_#in~y1|) (- 2))) (.cse20 (* 2 aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127)) (.cse21 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse19 (+ (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3) |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 1)) (.cse17 (* |aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| 3)) (.cse25 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse23 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse24 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= (+ 3 .cse17) .cse18) (<= .cse19 .cse18) (<= (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 9 .cse20) .cse21) (<= |c_gcd_#res| (+ |aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| 2)) (<= (+ .cse22 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 7) 0) (<= (+ 16 .cse23 .cse24) .cse21) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3) (<= .cse20 (+ .cse25 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 5) 5)) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (<= (+ .cse22 15 .cse23 .cse24) .cse20) (< .cse21 (+ 12 .cse23 .cse24)) (<= .cse19 .cse17) (<= (+ .cse25 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6) 2) (+ .cse23 .cse24))))) (<= (+ (div (+ 7 |c_gcd_#in~y1|) (- 2)) (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3) 2) (* 2 aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127)))) (forall ((|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (or (forall ((|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115 Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (let ((.cse31 (div (+ 7 |c_gcd_#in~y1|) (- 2))) (.cse32 (* 2 aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115)) (.cse30 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse28 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse29 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6)) (.cse26 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse27 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= (+ 2 .cse26 .cse27) (+ .cse28 .cse29)) (<= |c_gcd_#res| (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 2)) (< (+ aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3) (<= (+ .cse28 .cse29 16) .cse30) (< (+ .cse31 .cse30 1) .cse32) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (<= (+ .cse31 15 .cse26 .cse27) .cse32) (< .cse30 (+ 12 .cse26 .cse27)) (<= (+ .cse28 .cse29 2) (+ .cse26 .cse27))))) (< (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 2) (div |c_gcd_#in~y2| 2)))) (forall ((aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162 Int)) (or (< (+ 2 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162) |c_gcd_#in~y1|) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (forall ((aux_div_v_gcd_~y1_BEFORE_CALL_140_47 Int)) (let ((.cse33 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_47 2))) (or (<= (+ 5 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162) .cse33) (< .cse33 |c_gcd_#in~y1|) (forall ((|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse40 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_47 2)) (.cse41 (* 2 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162)) (.cse37 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse38 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2))) (let ((.cse35 (+ .cse37 9 .cse38)) (.cse39 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (.cse36 (+ .cse40 .cse41)) (.cse34 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2))) (or (< (+ 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) aux_div_v_gcd_~y1_BEFORE_CALL_140_47) (<= (+ .cse34 |c_gcd_#res|) .cse35) (<= .cse36 .cse35) (<= (+ .cse37 .cse38 13) .cse39) (<= (* 3 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162) (+ 7 .cse37 .cse38)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= (+ .cse40 2 .cse41) .cse39) (<= (+ .cse37 14 .cse38) .cse36) (<= (+ .cse34 2 |c_gcd_#res|) (+ |c_gcd_#in~y1| .cse41))))))))) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))))) (forall ((aux_div_v_gcd_~y2_BEFORE_CALL_88_139 Int)) (or (< (+ aux_div_v_gcd_~y2_BEFORE_CALL_88_139 1) |c_gcd_#in~y2|) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (let ((.cse42 (* 6 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (.cse43 (* |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 2)) (.cse45 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse44 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))) (or (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 3) (<= (+ .cse42 .cse43 12) (+ (* aux_div_v_gcd_~y2_BEFORE_CALL_88_139 2) |c_gcd_#in~y2|)) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ .cse44 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 1) .cse45) (<= (* aux_div_v_gcd_~y2_BEFORE_CALL_88_139 3) (+ .cse42 .cse43 7)) (<= (+ 3 .cse45) (+ .cse44 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div (+ (- 1) |c_gcd_#in~y1|) 2))))))) (forall ((aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101 Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (or (<= (+ 7 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|) 0) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|) 16 (* 2 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101)) 0) (<= 0 (+ 3 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101 (div (+ (- 1) |c_gcd_#in~y1|) 2))))) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (let ((.cse47 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|))) (let ((.cse48 (div |c_gcd_#in~y2| 2)) (.cse46 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (.cse49 (+ 3 .cse47))) (or (<= (+ .cse46 3) .cse47) (<= (+ 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) .cse48) (<= .cse49 .cse46) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ .cse47 8) (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 .cse48)) (<= (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 1) .cse48) (<= (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (+ .cse46 1)) (<= (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 2) .cse49))))) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (aux_div_v_gcd_~y2_BEFORE_CALL_88_78 Int)) (let ((.cse50 (* 2 aux_div_v_gcd_~y2_BEFORE_CALL_88_78)) (.cse51 (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|))) (or (< 0 (+ 7 .cse50 |c_gcd_#in~y2|)) (<= (+ .cse50 16 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) 0) (<= |c_gcd_#res| .cse51) (< .cse51 (div (+ (- 1) |c_gcd_#in~y1|) 2))))) (forall ((aux_div_v_gcd_~y1_BEFORE_CALL_140_114 Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (let ((.cse52 (* 6 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (.cse53 (* |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 2)) (.cse55 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse54 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))) (or (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div |c_gcd_#in~y2| 2)) (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 3) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|) (<= (* 3 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) (+ .cse52 .cse53 7)) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ .cse52 .cse53 13) (+ (* 2 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) |c_gcd_#in~y1|)) (< (+ 2 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) |c_gcd_#in~y1|) (<= (+ .cse54 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 1) .cse55) (<= (+ 3 .cse55) (+ .cse54 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))))) (forall ((|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (or (forall ((aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114 Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (let ((.cse56 (div (+ |c_gcd_#in~y2| 8) (- 2))) (.cse58 (* 2 aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114)) (.cse57 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse59 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse60 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse61 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= (+ .cse56 .cse57 |c_gcd_#res| 4) .cse58) (<= .cse59 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (< (+ aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (<= (+ 16 .cse60 .cse61) .cse59) (< |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 0) (<= (+ 5 .cse57 |c_gcd_#res|) .cse59) (<= (+ .cse56 15 .cse60 .cse61) .cse58) (< (+ .cse59 .cse56 1) .cse58) (<= (+ .cse57 |c_gcd_#res|) (+ 9 .cse60 .cse61)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (< .cse59 (+ 12 .cse60 .cse61)) (<= 3 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)))) (< (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 2) (div (+ (- 1) |c_gcd_#in~y1|) 2)))) (forall ((|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (or (< (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 2) (div |c_gcd_#in~y2| 2)) (forall ((aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115 Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (let ((.cse65 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse66 (div (+ 7 |c_gcd_#in~y1|) (- 2))) (.cse67 (* 2 aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115)) (.cse62 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse63 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse64 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= .cse62 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (<= (+ 16 .cse63 .cse64) .cse62) (< |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 0) (<= (+ 5 .cse65 |c_gcd_#res|) .cse62) (< (+ aux_div_aux_div_v_gcd_~y1_BEFORE_CALL_140_53_115 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (<= (+ .cse66 .cse65 |c_gcd_#res| 4) .cse67) (<= (+ .cse65 |c_gcd_#res|) (+ 9 .cse63 .cse64)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (< (+ .cse66 .cse62 1) .cse67) (<= (+ .cse66 15 .cse63 .cse64) .cse67) (< .cse62 (+ 12 .cse63 .cse64)) (<= 3 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)))))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (forall ((aux_div_v_gcd_~y1_BEFORE_CALL_140_53 Int)) (or (< 0 (+ |c_gcd_#in~y1| 6 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_53 2))) (forall ((aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_53_154 Int)) (or (forall ((|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse69 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (.cse73 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse68 (* 2 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_53_154)) (.cse71 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse72 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2)) (.cse70 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_53 2))) (or (<= .cse68 (+ .cse69 .cse70 4)) (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div |c_gcd_#in~y2| 2)) (<= (+ .cse71 .cse72 20 .cse70) .cse68) (<= (+ .cse73 |c_gcd_#res|) (+ .cse71 9 .cse72)) (<= (+ .cse71 .cse72 13) .cse69) (<= (+ .cse73 2 |c_gcd_#res|) (+ |c_gcd_#in~y1| .cse68)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= .cse68 (+ .cse71 15 .cse72 .cse70))))) (< (+ aux_div_v_gcd_~y1_BEFORE_CALL_140_53 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_53_154 4) 0))))) (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int) (aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162 Int)) (let ((.cse75 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse74 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))) (or (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 3) (< (+ 2 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162) |c_gcd_#in~y1|) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (<= (+ .cse74 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 1) .cse75) (<= (* 3 aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162) (+ (* 6 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|) (* |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 2) 7)) (<= (+ .cse74 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| 6) (+ aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_162 (div (+ (- 1) |c_gcd_#in~y1|) 2))) (<= (+ 3 .cse75) (+ .cse74 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))))) (forall ((aux_div_v_gcd_~y2_BEFORE_CALL_88_139 Int)) (or (< (+ aux_div_v_gcd_~y2_BEFORE_CALL_88_139 1) |c_gcd_#in~y2|) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (forall ((|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse76 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse78 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse79 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2)) (.cse77 (+ (* aux_div_v_gcd_~y2_BEFORE_CALL_88_139 2) |c_gcd_#in~y2|))) (or (<= (+ .cse76 |c_gcd_#res| 1) .cse77) (<= (+ .cse76 |c_gcd_#res|) (+ .cse78 9 .cse79)) (<= (+ .cse78 .cse79 13) (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= (* aux_div_v_gcd_~y2_BEFORE_CALL_88_139 3) (+ 7 .cse78 .cse79)) (<= (+ .cse78 .cse79 12) .cse77) (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div (+ (- 1) |c_gcd_#in~y1|) 2))))) (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3) (forall ((aux_div_v_gcd_~y2_BEFORE_CALL_88_78 Int)) (or (forall ((aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_78_152 Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse85 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (.cse84 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse83 (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_78_152 2)) (.cse80 (* 2 aux_div_v_gcd_~y2_BEFORE_CALL_88_78)) (.cse81 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse82 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2))) (or (<= (+ .cse80 .cse81 .cse82 20) .cse83) (<= (+ .cse84 |c_gcd_#res|) (+ .cse81 9 .cse82)) (<= .cse83 (+ .cse85 .cse80 4)) (<= (+ .cse81 .cse82 13) .cse85) (< (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_78_152 aux_div_v_gcd_~y2_BEFORE_CALL_88_78 4) 0) (<= (+ .cse84 |c_gcd_#res| 1) (+ |c_gcd_#in~y2| .cse83)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= .cse83 (+ .cse80 .cse81 15 .cse82)) (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div (+ (- 1) |c_gcd_#in~y1|) 2))))) (< 0 (+ 7 (* 2 aux_div_v_gcd_~y2_BEFORE_CALL_88_78) |c_gcd_#in~y2|)))))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (forall ((aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 Int)) (or (forall ((aux_div_v_gcd_~y2_BEFORE_CALL_88_82 Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse86 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse87 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2)) (.cse89 (* 2 aux_div_v_gcd_~y2_BEFORE_CALL_88_82)) (.cse90 (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 2))) (let ((.cse88 (+ .cse89 .cse90)) (.cse93 (+ .cse86 9 .cse87)) (.cse92 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse91 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3))) (or (<= (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 3) (+ 7 .cse86 .cse87)) (<= (+ .cse86 14 .cse87) .cse88) (<= (+ 2 .cse89 .cse90) .cse91) (<= (+ .cse92 |c_gcd_#res|) .cse93) (<= .cse88 .cse93) (<= (+ .cse92 |c_gcd_#res| 1) (+ .cse90 |c_gcd_#in~y2|)) (< (+ 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) aux_div_v_gcd_~y2_BEFORE_CALL_88_82) (<= (+ .cse86 .cse87 13) .cse91) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (< .cse89 (+ |c_gcd_#in~y2| 1)))))) (< (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 1) |c_gcd_#in~y2|))) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))) (forall ((|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (or (forall ((aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114 Int) (|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (let ((.cse99 (div (+ |c_gcd_#in~y2| 8) (- 2))) (.cse100 (* 2 aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114)) (.cse98 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse96 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse97 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6)) (.cse94 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse95 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= (+ 2 .cse94 .cse95) (+ .cse96 .cse97)) (<= |c_gcd_#res| (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 2)) (< (+ aux_div_aux_div_v_gcd_~y2_BEFORE_CALL_88_78_114 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|) (< (+ .cse98 .cse99 1) .cse100) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3) (<= (+ .cse96 .cse97 16) .cse98) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (<= (+ .cse96 .cse97 .cse99 15) .cse100) (< .cse98 (+ 12 .cse94 .cse95)) (<= (+ .cse96 .cse97 2) (+ .cse94 .cse95))))) (< (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 2) (div (+ (- 1) |c_gcd_#in~y1|) 2)))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (forall ((aux_div_v_gcd_~y1_BEFORE_CALL_140_114 Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse101 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse102 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2))) (let ((.cse103 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse105 (+ .cse101 .cse102 13)) (.cse104 (+ (* 2 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) |c_gcd_#in~y1|))) (or (< (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (div |c_gcd_#in~y2| 2)) (<= (* 3 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) (+ 7 .cse101 .cse102)) (<= (+ .cse103 2 |c_gcd_#res|) .cse104) (<= (+ .cse103 |c_gcd_#res|) (+ .cse101 9 .cse102)) (<= .cse105 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (< (+ 2 aux_div_v_gcd_~y1_BEFORE_CALL_140_114) |c_gcd_#in~y1|) (<= .cse105 .cse104))))) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))) (forall ((aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (or (<= (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3) (+ (* aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 2) 2 (div |c_gcd_#in~y2| 2))) (forall ((|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (let ((.cse107 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3)) (.cse111 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse108 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3)) (.cse106 (* |aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| 3)) (.cse109 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse110 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6)) (.cse112 (* aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 2)) (.cse113 (div |c_gcd_#in~y2| 2))) (or (<= (+ 3 .cse106) (+ .cse107 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (<= (+ .cse107 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 1) .cse108) (<= |c_gcd_#res| (+ |aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_243_94| 2)) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (<= (+ .cse109 .cse110 16) .cse111) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (< .cse111 (+ .cse109 .cse110 12)) (<= (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| .cse112) (+ .cse109 .cse110 5)) (< (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 2) .cse113) (<= (+ |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| .cse112 9) .cse111) (<= (+ .cse108 3) .cse106) (<= (+ .cse109 .cse110 11) (+ .cse112 .cse113))))) (< (+ aux_div_aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_99_125 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70| Int)) (let ((.cse114 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse115 (* 3 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|))) (or (<= (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 3) (+ 7 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2))) (<= (+ |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 6 .cse114) (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 (div |c_gcd_#in~y2| 2))) (<= |c_gcd_#res| (+ 2 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_78_171_70|)) (< (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 1) |c_gcd_#in~y2|) (<= (+ .cse115 3) (+ |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| .cse114)) (<= (+ |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| .cse114 1) .cse115)))) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3))) (forall ((|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int) (aux_div_v_gcd_~y1_BEFORE_CALL_140_53 Int)) (let ((.cse117 (+ 2 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse116 (* aux_div_v_gcd_~y1_BEFORE_CALL_140_53 2))) (or (< 0 (+ |c_gcd_#in~y1| 6 .cse116)) (< .cse117 (div |c_gcd_#in~y2| 2)) (<= |c_gcd_#res| .cse117) (<= (+ 16 (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) .cse116) 0)))) (forall ((aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127 Int) (|aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| Int)) (or (< (+ aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127 1) |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98|) (<= (+ (div (+ 7 |c_gcd_#in~y1|) (- 2)) (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3) 2) (* 2 aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127)) (forall ((|aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int) (|aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| Int) (|aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| Int)) (let ((.cse119 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse118 (div (+ 7 |c_gcd_#in~y1|) (- 2))) (.cse120 (* 2 aux_div_aux_div_aux_mod_v_gcd_~y1_BEFORE_CALL_140_47_101_127)) (.cse121 (* |aux_div_v_gcd_#in~y2_BEFORE_CALL_62_98| 3)) (.cse124 (* 2 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|)) (.cse125 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 6)) (.cse122 (* 2 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|)) (.cse123 (* |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 6))) (or (<= (+ .cse118 .cse119 |c_gcd_#res| 4) .cse120) (<= .cse121 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3)) (<= (+ 2 .cse122 .cse123) (+ .cse124 .cse125)) (<= (+ |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 9 .cse120) .cse121) (<= (+ .cse118 |aux_div_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 7) 0) (<= (+ 16 .cse122 .cse123) .cse121) (<= (+ 5 .cse119 |c_gcd_#res|) .cse121) (> 0 |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70|) (<= (+ .cse119 |c_gcd_#res|) (+ .cse124 .cse125 9)) (> 0 |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82|) (>= |aux_mod_aux_div_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_70| 3) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= .cse120 (+ .cse124 (* |aux_div_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 5) 5)) (>= |aux_mod_aux_div_aux_mod_aux_mod_v_gcd_#in~y2_BEFORE_CALL_62_98_115_207_82| 3) (<= (+ .cse118 15 .cse122 .cse123) .cse120) (< .cse121 (+ 12 .cse122 .cse123)) (<= (+ .cse124 .cse125 2) (+ .cse122 .cse123))))))) (forall ((|aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (or (> 0 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) (forall ((aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 Int) (aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 Int)) (or (< (+ aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 4) 0) (<= 0 (+ aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 3 (div |c_gcd_#in~y2| 2))) (forall ((|aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| Int) (|aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| Int)) (let ((.cse129 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 2)) (.cse126 (* aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160 2)) (.cse128 (* aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 2)) (.cse130 (* 6 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|)) (.cse131 (* |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 2)) (.cse127 (* |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120| 3))) (or (<= (+ aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| (* 3 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) 10) aux_div_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160) (<= .cse126 (+ .cse127 .cse128 4)) (<= (+ .cse129 |c_gcd_#res|) (+ .cse130 9 .cse131)) (<= (+ .cse129 |c_gcd_#res| 1) (+ .cse126 |c_gcd_#in~y2|)) (<= .cse126 (+ .cse128 .cse130 15 .cse131)) (<= (+ .cse130 .cse131 13) .cse127) (<= (+ |c_gcd_#res| 1) |aux_div_v_gcd_#t~ret5_AFTER_RETURN_25_120|) (<= (+ aux_div_aux_mod_aux_mod_v_gcd_~y2_BEFORE_CALL_88_82_160_200 7 |aux_div_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58|) 0)))))) (>= |aux_mod_aux_div_v_gcd_#in~y2_BEFORE_CALL_62_78_58| 3)))) is different from false