/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SequenceOfStatements --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=SHALLOWEST --traceabstraction.additional.smt.options log-additional-information=true --traceabstraction.additional.smt.options unknown-allowed=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf language data_model -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label58.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-26 22:33:56,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 22:33:56,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 22:33:56,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 22:33:56,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 22:33:56,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 22:33:56,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 22:33:56,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 22:33:56,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 22:33:56,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 22:33:56,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 22:33:56,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 22:33:56,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 22:33:56,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 22:33:56,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 22:33:56,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 22:33:56,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 22:33:56,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 22:33:56,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 22:33:56,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 22:33:56,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 22:33:56,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 22:33:56,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 22:33:56,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 22:33:56,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 22:33:56,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 22:33:56,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 22:33:56,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 22:33:56,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 22:33:56,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 22:33:56,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 22:33:56,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 22:33:56,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 22:33:56,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 22:33:56,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 22:33:56,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 22:33:56,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 22:33:56,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 22:33:56,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 22:33:56,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 22:33:56,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 22:33:56,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-26 22:33:56,475 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 22:33:56,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 22:33:56,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 22:33:56,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 22:33:56,481 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 22:33:56,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 22:33:56,482 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 22:33:56,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 22:33:56,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 22:33:56,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 22:33:56,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 22:33:56,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 22:33:56,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 22:33:56,484 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 22:33:56,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 22:33:56,484 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 22:33:56,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 22:33:56,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 22:33:56,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 22:33:56,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 22:33:56,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 22:33:56,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 22:33:56,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 22:33:56,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 22:33:56,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 22:33:56,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 22:33:56,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 22:33:56,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 22:33:56,487 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 22:33:56,487 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-2/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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SequenceOfStatements Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=SHALLOWEST;log-additional-information=true;unknown-allowed=true; [2020-10-26 22:33:56,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 22:33:56,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 22:33:56,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 22:33:56,955 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 22:33:56,956 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 22:33:56,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label58.c [2020-10-26 22:33:57,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0a81ac08d/e55a9a2f5195439eb2ccc7f9a567e4fe/FLAGe1e2496cf [2020-10-26 22:33:57,764 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 22:33:57,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label58.c [2020-10-26 22:33:57,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0a81ac08d/e55a9a2f5195439eb2ccc7f9a567e4fe/FLAGe1e2496cf [2020-10-26 22:33:58,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0a81ac08d/e55a9a2f5195439eb2ccc7f9a567e4fe [2020-10-26 22:33:58,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 22:33:58,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-26 22:33:58,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 22:33:58,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 22:33:58,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 22:33:58,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:58" (1/1) ... [2020-10-26 22:33:58,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf6f8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58, skipping insertion in model container [2020-10-26 22:33:58,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:58" (1/1) ... [2020-10-26 22:33:58,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 22:33:58,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 22:33:58,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:33:58,599 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 22:33:58,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:33:58,827 INFO L208 MainTranslator]: Completed translation [2020-10-26 22:33:58,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58 WrapperNode [2020-10-26 22:33:58,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 22:33:58,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 22:33:58,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 22:33:58,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 22:33:58,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58" (1/1) ... [2020-10-26 22:33:58,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58" (1/1) ... [2020-10-26 22:33:58,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58" (1/1) ... [2020-10-26 22:33:58,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58" (1/1) ... [2020-10-26 22:33:58,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58" (1/1) ... [2020-10-26 22:33:58,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58" (1/1) ... [2020-10-26 22:33:58,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58" (1/1) ... [2020-10-26 22:33:58,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 22:33:58,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 22:33:58,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 22:33:58,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 22:33:58,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 22:33:59,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 22:33:59,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 22:33:59,086 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 22:33:59,086 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-26 22:33:59,087 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 22:33:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-26 22:33:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 22:33:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 22:33:59,087 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 22:33:59,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 22:33:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 22:33:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-26 22:33:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 22:33:59,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 22:33:59,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 22:33:59,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 22:33:59,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 22:33:59,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 22:33:59,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 22:34:00,729 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 22:34:00,730 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 22:34:00,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:34:00 BoogieIcfgContainer [2020-10-26 22:34:00,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 22:34:00,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 22:34:00,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 22:34:00,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 22:34:00,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:33:58" (1/3) ... [2020-10-26 22:34:00,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1480064a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:34:00, skipping insertion in model container [2020-10-26 22:34:00,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:58" (2/3) ... [2020-10-26 22:34:00,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1480064a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:34:00, skipping insertion in model container [2020-10-26 22:34:00,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:34:00" (3/3) ... [2020-10-26 22:34:00,742 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label58.c [2020-10-26 22:34:00,755 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-26 22:34:00,761 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-26 22:34:00,776 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-26 22:34:00,805 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 22:34:00,806 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 22:34:00,806 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-26 22:34:00,806 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 22:34:00,806 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 22:34:00,806 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 22:34:00,806 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 22:34:00,806 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 22:34:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-26 22:34:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 22:34:00,838 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:00,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:00,839 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash 357363100, now seen corresponding path program 1 times [2020-10-26 22:34:00,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:00,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1685063410] [2020-10-26 22:34:00,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:01,055 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:01,545 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:01,546 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 30 [2020-10-26 22:34:01,546 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:01,546 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 530 [2020-10-26 22:34:01,550 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:01,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:34:01,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:34:01,550 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 21 [2020-10-26 22:34:01,551 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-10-26 22:34:01,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:01,713 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:01,749 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:01,749 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:01,750 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:01,751 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 45 [2020-10-26 22:34:01,751 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:01,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:01,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:01,753 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:34:01,753 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:34:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:34:01,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1685063410] [2020-10-26 22:34:01,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:34:01,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 22:34:01,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178688463] [2020-10-26 22:34:01,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 22:34:01,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 22:34:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 22:34:01,818 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-26 22:34:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:03,627 INFO L93 Difference]: Finished difference Result 586 states and 1012 transitions. [2020-10-26 22:34:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:34:03,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-26 22:34:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:03,658 INFO L225 Difference]: With dead ends: 586 [2020-10-26 22:34:03,659 INFO L226 Difference]: Without dead ends: 303 [2020-10-26 22:34:03,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:34:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-26 22:34:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-10-26 22:34:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-26 22:34:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 396 transitions. [2020-10-26 22:34:03,755 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 396 transitions. Word has length 20 [2020-10-26 22:34:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:03,755 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 396 transitions. [2020-10-26 22:34:03,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 22:34:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 396 transitions. [2020-10-26 22:34:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-26 22:34:03,760 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:03,760 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 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] [2020-10-26 22:34:03,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 22:34:03,761 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:03,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2010440288, now seen corresponding path program 1 times [2020-10-26 22:34:03,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:03,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177547422] [2020-10-26 22:34:03,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:03,832 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,942 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:04,852 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:04,853 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 102 [2020-10-26 22:34:04,853 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:04,854 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1045 [2020-10-26 22:34:04,855 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:04,855 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-26 22:34:04,855 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:34:04,856 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-26 22:34:04,856 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:34:04,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:04,971 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:04,985 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:04,985 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:04,986 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:04,987 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-10-26 22:34:04,990 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:04,990 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:04,990 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:04,991 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:34:04,991 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:05,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:05,092 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:05,150 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:05,297 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:05,297 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:34:05,302 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:05,302 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 215 [2020-10-26 22:34:05,302 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:05,302 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:05,303 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:05,303 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 71 [2020-10-26 22:34:05,305 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-26 22:34:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 22:34:05,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177547422] [2020-10-26 22:34:05,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:05,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:34:05,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841312115] [2020-10-26 22:34:05,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:34:05,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:05,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:34:05,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:34:05,515 INFO L87 Difference]: Start difference. First operand 299 states and 396 transitions. Second operand 6 states. [2020-10-26 22:34:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:07,154 INFO L93 Difference]: Finished difference Result 890 states and 1204 transitions. [2020-10-26 22:34:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 22:34:07,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2020-10-26 22:34:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:07,161 INFO L225 Difference]: With dead ends: 890 [2020-10-26 22:34:07,161 INFO L226 Difference]: Without dead ends: 597 [2020-10-26 22:34:07,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-10-26 22:34:07,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 591. [2020-10-26 22:34:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-26 22:34:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 760 transitions. [2020-10-26 22:34:07,260 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 760 transitions. Word has length 90 [2020-10-26 22:34:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:07,261 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 760 transitions. [2020-10-26 22:34:07,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:34:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 760 transitions. [2020-10-26 22:34:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-26 22:34:07,267 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:07,268 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:07,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 22:34:07,274 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:07,275 INFO L82 PathProgramCache]: Analyzing trace with hash 533123296, now seen corresponding path program 1 times [2020-10-26 22:34:07,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:07,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1958426980] [2020-10-26 22:34:07,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:07,338 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:07,534 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:07,535 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 111 [2020-10-26 22:34:07,535 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:07,535 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 215 [2020-10-26 22:34:07,535 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:07,535 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:07,536 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:34:07,536 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 18 [2020-10-26 22:34:07,536 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:07,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:07,635 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:07,639 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:07,640 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:07,640 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:07,640 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:34:07,640 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:07,641 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:07,641 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:07,641 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:07,641 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:07,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:07,687 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:07,759 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:07,759 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:34:07,760 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:07,760 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 84 [2020-10-26 22:34:07,760 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:07,760 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:07,760 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:07,760 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:34:07,761 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:34:07,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1958426980] [2020-10-26 22:34:07,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:07,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:34:07,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134379797] [2020-10-26 22:34:07,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:34:07,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:34:07,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:34:07,854 INFO L87 Difference]: Start difference. First operand 591 states and 760 transitions. Second operand 5 states. [2020-10-26 22:34:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:09,650 INFO L93 Difference]: Finished difference Result 1472 states and 1973 transitions. [2020-10-26 22:34:09,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:34:09,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-10-26 22:34:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:09,666 INFO L225 Difference]: With dead ends: 1472 [2020-10-26 22:34:09,666 INFO L226 Difference]: Without dead ends: 887 [2020-10-26 22:34:09,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:34:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-26 22:34:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 881. [2020-10-26 22:34:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2020-10-26 22:34:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1119 transitions. [2020-10-26 22:34:09,722 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1119 transitions. Word has length 99 [2020-10-26 22:34:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:09,723 INFO L481 AbstractCegarLoop]: Abstraction has 881 states and 1119 transitions. [2020-10-26 22:34:09,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:34:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1119 transitions. [2020-10-26 22:34:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-10-26 22:34:09,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:09,739 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2020-10-26 22:34:09,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 22:34:09,739 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:09,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:09,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1162283048, now seen corresponding path program 1 times [2020-10-26 22:34:09,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:09,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265497237] [2020-10-26 22:34:09,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:09,828 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:09,916 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,449 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,775 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:11,626 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:11,627 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 186 [2020-10-26 22:34:11,627 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:34:11,627 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1829 [2020-10-26 22:34:11,627 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:11,627 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:11,629 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:34:11,631 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-26 22:34:11,631 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-10-26 22:34:11,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:11,824 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:11,829 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:11,829 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:11,830 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:11,830 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:34:11,830 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:11,830 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:11,830 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:11,831 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:11,831 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:11,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:11,892 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:11,963 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:11,963 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:34:11,964 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:11,964 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 88 [2020-10-26 22:34:11,964 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:11,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:11,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:11,965 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:34:11,965 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:12,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-26 22:34:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:12,038 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:12,091 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:12,232 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:12,232 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:34:12,232 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:12,233 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 205 [2020-10-26 22:34:12,233 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:12,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:12,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:12,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:34:12,234 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:34:12,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265497237] [2020-10-26 22:34:12,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:12,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:34:12,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153369332] [2020-10-26 22:34:12,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:34:12,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:12,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:34:12,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:34:12,508 INFO L87 Difference]: Start difference. First operand 881 states and 1119 transitions. Second operand 6 states. [2020-10-26 22:34:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:14,184 INFO L93 Difference]: Finished difference Result 1805 states and 2304 transitions. [2020-10-26 22:34:14,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 22:34:14,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2020-10-26 22:34:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:14,191 INFO L225 Difference]: With dead ends: 1805 [2020-10-26 22:34:14,191 INFO L226 Difference]: Without dead ends: 907 [2020-10-26 22:34:14,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-26 22:34:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-10-26 22:34:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 881. [2020-10-26 22:34:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2020-10-26 22:34:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1114 transitions. [2020-10-26 22:34:14,231 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1114 transitions. Word has length 172 [2020-10-26 22:34:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:14,232 INFO L481 AbstractCegarLoop]: Abstraction has 881 states and 1114 transitions. [2020-10-26 22:34:14,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:34:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1114 transitions. [2020-10-26 22:34:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-10-26 22:34:14,235 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:14,235 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:14,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 22:34:14,236 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:14,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1697170172, now seen corresponding path program 1 times [2020-10-26 22:34:14,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:14,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [472102708] [2020-10-26 22:34:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:14,308 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:14,475 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,078 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,078 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 194 [2020-10-26 22:34:15,078 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:15,078 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 797 [2020-10-26 22:34:15,079 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,079 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:34:15,079 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:34:15,079 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:34:15,079 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:15,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:15,187 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,193 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,194 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:15,194 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:15,194 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-26 22:34:15,194 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:15,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:15,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:15,195 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:15,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:15,230 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,269 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,270 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:34:15,270 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:15,270 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 47 [2020-10-26 22:34:15,270 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,270 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:15,271 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:15,271 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:34:15,271 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:15,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:34:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:15,320 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,418 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,496 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,496 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:34:15,496 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:15,497 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 187 [2020-10-26 22:34:15,497 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,497 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:15,497 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:15,497 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-26 22:34:15,497 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 22:34:15,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [472102708] [2020-10-26 22:34:15,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:15,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:34:15,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310529185] [2020-10-26 22:34:15,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:34:15,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:34:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:34:15,797 INFO L87 Difference]: Start difference. First operand 881 states and 1114 transitions. Second operand 6 states. [2020-10-26 22:34:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:17,579 INFO L93 Difference]: Finished difference Result 2076 states and 2732 transitions. [2020-10-26 22:34:17,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 22:34:17,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2020-10-26 22:34:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:17,589 INFO L225 Difference]: With dead ends: 2076 [2020-10-26 22:34:17,589 INFO L226 Difference]: Without dead ends: 1201 [2020-10-26 22:34:17,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:17,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-10-26 22:34:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1038. [2020-10-26 22:34:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2020-10-26 22:34:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1295 transitions. [2020-10-26 22:34:17,640 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1295 transitions. Word has length 180 [2020-10-26 22:34:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:17,640 INFO L481 AbstractCegarLoop]: Abstraction has 1038 states and 1295 transitions. [2020-10-26 22:34:17,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:34:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1295 transitions. [2020-10-26 22:34:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-10-26 22:34:17,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:17,644 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:17,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 22:34:17,645 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:17,645 INFO L82 PathProgramCache]: Analyzing trace with hash 863075968, now seen corresponding path program 1 times [2020-10-26 22:34:17,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:17,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [155830547] [2020-10-26 22:34:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:17,699 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:17,766 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:18,594 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:20,193 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:20,193 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 201 [2020-10-26 22:34:20,193 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:34:20,193 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2512 [2020-10-26 22:34:20,194 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:20,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:34:20,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:34:20,194 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 83 [2020-10-26 22:34:20,194 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:20,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:20,317 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:20,334 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:20,334 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:20,335 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:20,335 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 27 [2020-10-26 22:34:20,335 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:20,335 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:20,335 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:20,336 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:34:20,336 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:20,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:20,391 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:20,502 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:20,502 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:34:20,502 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:20,502 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 122 [2020-10-26 22:34:20,503 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:20,503 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:20,503 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:20,503 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-26 22:34:20,503 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:20,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-26 22:34:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:20,670 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:20,702 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:20,702 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:34:20,702 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:20,702 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 43 [2020-10-26 22:34:20,703 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:20,703 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:20,703 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-10-26 22:34:20,703 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:20,704 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 22:34:20,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [155830547] [2020-10-26 22:34:20,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:20,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:34:20,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881268037] [2020-10-26 22:34:20,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:34:20,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:20,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:34:20,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:20,826 INFO L87 Difference]: Start difference. First operand 1038 states and 1295 transitions. Second operand 7 states. [2020-10-26 22:34:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:22,698 INFO L93 Difference]: Finished difference Result 2386 states and 2959 transitions. [2020-10-26 22:34:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:34:22,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2020-10-26 22:34:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:22,707 INFO L225 Difference]: With dead ends: 2386 [2020-10-26 22:34:22,707 INFO L226 Difference]: Without dead ends: 1354 [2020-10-26 22:34:22,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:34:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-10-26 22:34:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1344. [2020-10-26 22:34:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2020-10-26 22:34:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1632 transitions. [2020-10-26 22:34:22,771 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1632 transitions. Word has length 187 [2020-10-26 22:34:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:22,772 INFO L481 AbstractCegarLoop]: Abstraction has 1344 states and 1632 transitions. [2020-10-26 22:34:22,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:34:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1632 transitions. [2020-10-26 22:34:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2020-10-26 22:34:22,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:22,778 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:22,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 22:34:22,778 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:22,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1063717656, now seen corresponding path program 1 times [2020-10-26 22:34:22,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:22,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [712197778] [2020-10-26 22:34:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:22,912 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:23,608 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:23,609 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 290 [2020-10-26 22:34:23,609 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:23,609 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 737 [2020-10-26 22:34:23,609 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:23,609 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 7 [2020-10-26 22:34:23,609 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:34:23,610 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 161 [2020-10-26 22:34:23,610 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:23,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:23,757 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:23,763 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:23,764 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:23,764 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:23,764 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-26 22:34:23,764 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:23,764 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:23,765 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:23,765 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:23,765 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:23,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:23,834 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:23,917 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:23,918 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:23,918 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:23,918 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 101 [2020-10-26 22:34:23,918 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:23,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:23,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:23,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:34:23,919 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:23,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:24,016 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:24,280 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:24,280 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-26 22:34:24,280 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:24,281 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 293 [2020-10-26 22:34:24,281 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:24,281 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-10-26 22:34:24,281 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:24,281 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-26 22:34:24,281 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 126 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:34:24,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [712197778] [2020-10-26 22:34:24,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:24,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-26 22:34:24,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151312627] [2020-10-26 22:34:24,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 22:34:24,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:24,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 22:34:24,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:34:24,479 INFO L87 Difference]: Start difference. First operand 1344 states and 1632 transitions. Second operand 8 states. [2020-10-26 22:34:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:27,785 INFO L93 Difference]: Finished difference Result 4334 states and 5534 transitions. [2020-10-26 22:34:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 22:34:27,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 276 [2020-10-26 22:34:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:27,805 INFO L225 Difference]: With dead ends: 4334 [2020-10-26 22:34:27,805 INFO L226 Difference]: Without dead ends: 3139 [2020-10-26 22:34:27,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-10-26 22:34:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2020-10-26 22:34:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2836. [2020-10-26 22:34:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2020-10-26 22:34:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 3537 transitions. [2020-10-26 22:34:27,912 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 3537 transitions. Word has length 276 [2020-10-26 22:34:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:27,912 INFO L481 AbstractCegarLoop]: Abstraction has 2836 states and 3537 transitions. [2020-10-26 22:34:27,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 22:34:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3537 transitions. [2020-10-26 22:34:27,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2020-10-26 22:34:27,920 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:27,920 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:27,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 22:34:27,921 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:27,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:27,921 INFO L82 PathProgramCache]: Analyzing trace with hash -524829692, now seen corresponding path program 1 times [2020-10-26 22:34:27,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:27,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1025731833] [2020-10-26 22:34:27,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:28,045 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:28,138 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:29,221 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:30,470 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:30,471 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 318 [2020-10-26 22:34:30,472 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:34:30,472 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2464 [2020-10-26 22:34:30,472 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:30,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:30,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:34:30,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-26 22:34:30,473 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:30,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:30,612 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:30,616 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:30,617 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:30,617 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:30,617 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:34:30,617 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:30,617 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:30,618 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:30,618 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:30,618 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:30,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:30,691 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:30,772 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:30,773 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:30,773 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:30,773 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 110 [2020-10-26 22:34:30,773 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:30,773 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:30,774 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:30,774 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:34:30,774 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:30,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:30,848 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:30,964 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:30,965 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:34:30,965 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:30,965 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 126 [2020-10-26 22:34:30,965 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:30,965 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:30,966 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:30,966 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-26 22:34:30,966 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:31,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2020-10-26 22:34:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:31,090 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:31,118 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:31,118 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:34:31,118 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:31,118 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 37 [2020-10-26 22:34:31,119 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:31,119 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:31,119 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-10-26 22:34:31,119 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:31,119 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 114 proven. 76 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-10-26 22:34:31,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1025731833] [2020-10-26 22:34:31,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:31,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-26 22:34:31,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295421275] [2020-10-26 22:34:31,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 22:34:31,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:31,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 22:34:31,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:34:31,347 INFO L87 Difference]: Start difference. First operand 2836 states and 3537 transitions. Second operand 8 states. [2020-10-26 22:34:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:33,809 INFO L93 Difference]: Finished difference Result 6563 states and 8367 transitions. [2020-10-26 22:34:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 22:34:33,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 302 [2020-10-26 22:34:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:33,841 INFO L225 Difference]: With dead ends: 6563 [2020-10-26 22:34:33,841 INFO L226 Difference]: Without dead ends: 3876 [2020-10-26 22:34:33,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:34:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3876 states. [2020-10-26 22:34:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3876 to 3869. [2020-10-26 22:34:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3869 states. [2020-10-26 22:34:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 4730 transitions. [2020-10-26 22:34:33,971 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 4730 transitions. Word has length 302 [2020-10-26 22:34:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:33,972 INFO L481 AbstractCegarLoop]: Abstraction has 3869 states and 4730 transitions. [2020-10-26 22:34:33,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 22:34:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 4730 transitions. [2020-10-26 22:34:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2020-10-26 22:34:33,982 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:33,982 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:33,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 22:34:33,983 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:33,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:33,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1009453636, now seen corresponding path program 1 times [2020-10-26 22:34:33,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:33,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [399245851] [2020-10-26 22:34:33,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:34,135 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:34,539 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:34,906 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:34,906 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 337 [2020-10-26 22:34:34,906 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:34,907 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 855 [2020-10-26 22:34:34,907 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:34,907 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:34:34,907 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 223 [2020-10-26 22:34:34,908 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:34:34,908 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:34:35,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:35,054 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:35,059 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:35,059 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:35,060 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:35,060 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:34:35,061 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:35,061 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:35,061 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:35,061 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:35,061 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:34:35,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:35,096 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:35,137 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:35,138 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 135 [2020-10-26 22:34:35,138 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:35,138 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 43 [2020-10-26 22:34:35,138 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:35,138 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:35,138 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:35,139 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:35,139 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:35,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-26 22:34:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:35,206 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:35,267 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:35,267 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:34:35,267 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:35,267 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 71 [2020-10-26 22:34:35,268 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:35,268 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:35,268 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:35,268 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-26 22:34:35,268 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:35,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-10-26 22:34:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:35,320 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:35,399 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:35,574 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:35,574 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:34:35,574 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:35,574 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 266 [2020-10-26 22:34:35,575 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:35,575 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:35,575 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:35,575 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-26 22:34:35,575 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 187 proven. 13 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-10-26 22:34:35,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [399245851] [2020-10-26 22:34:35,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:35,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:34:35,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592349164] [2020-10-26 22:34:35,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:34:35,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:35,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:34:35,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:35,729 INFO L87 Difference]: Start difference. First operand 3869 states and 4730 transitions. Second operand 7 states. [2020-10-26 22:34:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:37,999 INFO L93 Difference]: Finished difference Result 7887 states and 9830 transitions. [2020-10-26 22:34:37,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:34:38,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 321 [2020-10-26 22:34:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:38,022 INFO L225 Difference]: With dead ends: 7887 [2020-10-26 22:34:38,022 INFO L226 Difference]: Without dead ends: 4167 [2020-10-26 22:34:38,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:34:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2020-10-26 22:34:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4016. [2020-10-26 22:34:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4016 states. [2020-10-26 22:34:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4016 states to 4016 states and 4873 transitions. [2020-10-26 22:34:38,159 INFO L78 Accepts]: Start accepts. Automaton has 4016 states and 4873 transitions. Word has length 321 [2020-10-26 22:34:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:38,160 INFO L481 AbstractCegarLoop]: Abstraction has 4016 states and 4873 transitions. [2020-10-26 22:34:38,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:34:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4016 states and 4873 transitions. [2020-10-26 22:34:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2020-10-26 22:34:38,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:38,172 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1] [2020-10-26 22:34:38,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 22:34:38,172 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash -282846808, now seen corresponding path program 1 times [2020-10-26 22:34:38,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:38,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1289910372] [2020-10-26 22:34:38,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:38,298 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:38,670 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:39,504 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:39,504 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 347 [2020-10-26 22:34:39,504 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:39,504 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1254 [2020-10-26 22:34:39,504 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:39,505 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:34:39,505 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 233 [2020-10-26 22:34:39,505 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:34:39,505 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:39,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:39,641 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:39,647 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:39,647 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:39,647 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:39,647 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:34:39,647 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:39,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:39,648 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:39,648 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:39,648 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:39,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:39,674 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:39,716 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:39,716 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 135 [2020-10-26 22:34:39,716 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:39,717 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 43 [2020-10-26 22:34:39,717 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:39,717 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:39,717 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:39,717 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:39,717 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:39,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-26 22:34:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:39,791 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:39,859 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:39,859 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-26 22:34:39,860 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:39,860 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 79 [2020-10-26 22:34:39,860 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:39,860 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:39,860 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:39,860 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-26 22:34:39,860 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:39,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-10-26 22:34:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:39,913 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:39,955 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:40,103 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:40,103 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:34:40,103 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:40,103 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 200 [2020-10-26 22:34:40,104 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:40,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:40,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:40,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-26 22:34:40,104 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 197 proven. 13 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-10-26 22:34:40,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1289910372] [2020-10-26 22:34:40,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:40,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:34:40,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686435376] [2020-10-26 22:34:40,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:34:40,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:40,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:34:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:34:40,311 INFO L87 Difference]: Start difference. First operand 4016 states and 4873 transitions. Second operand 6 states. [2020-10-26 22:34:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:42,120 INFO L93 Difference]: Finished difference Result 9184 states and 11171 transitions. [2020-10-26 22:34:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 22:34:42,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 331 [2020-10-26 22:34:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:42,148 INFO L225 Difference]: With dead ends: 9184 [2020-10-26 22:34:42,148 INFO L226 Difference]: Without dead ends: 5317 [2020-10-26 22:34:42,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2020-10-26 22:34:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 5174. [2020-10-26 22:34:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5174 states. [2020-10-26 22:34:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5174 states to 5174 states and 6217 transitions. [2020-10-26 22:34:42,325 INFO L78 Accepts]: Start accepts. Automaton has 5174 states and 6217 transitions. Word has length 331 [2020-10-26 22:34:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:42,326 INFO L481 AbstractCegarLoop]: Abstraction has 5174 states and 6217 transitions. [2020-10-26 22:34:42,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:34:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 5174 states and 6217 transitions. [2020-10-26 22:34:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2020-10-26 22:34:42,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:42,337 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:42,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 22:34:42,338 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1594452284, now seen corresponding path program 1 times [2020-10-26 22:34:42,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:42,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990763124] [2020-10-26 22:34:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:42,465 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:42,865 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:43,231 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:43,231 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 350 [2020-10-26 22:34:43,232 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:43,232 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 816 [2020-10-26 22:34:43,232 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:43,232 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:43,232 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 328 [2020-10-26 22:34:43,232 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 18 [2020-10-26 22:34:43,232 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:43,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:43,354 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:43,362 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:43,363 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:43,363 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:43,363 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-10-26 22:34:43,363 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:43,364 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:43,364 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:43,364 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:43,364 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:43,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:43,391 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:43,427 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:43,427 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:43,428 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:43,428 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 37 [2020-10-26 22:34:43,428 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:43,428 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:43,428 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:43,429 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:43,429 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:43,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:43,471 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:43,487 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:43,488 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-26 22:34:43,488 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:43,488 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 17 [2020-10-26 22:34:43,488 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:43,488 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:43,488 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:43,489 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:43,489 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:43,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-10-26 22:34:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:43,558 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:43,652 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:43,652 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 128 [2020-10-26 22:34:43,652 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:43,652 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 113 [2020-10-26 22:34:43,652 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:43,652 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:43,653 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:43,653 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-26 22:34:43,653 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-26 22:34:43,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990763124] [2020-10-26 22:34:43,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:43,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:34:43,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475103117] [2020-10-26 22:34:43,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:34:43,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:43,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:34:43,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:34:43,781 INFO L87 Difference]: Start difference. First operand 5174 states and 6217 transitions. Second operand 5 states. [2020-10-26 22:34:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:45,461 INFO L93 Difference]: Finished difference Result 11351 states and 13851 transitions. [2020-10-26 22:34:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:34:45,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 334 [2020-10-26 22:34:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:45,497 INFO L225 Difference]: With dead ends: 11351 [2020-10-26 22:34:45,498 INFO L226 Difference]: Without dead ends: 6326 [2020-10-26 22:34:45,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:34:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2020-10-26 22:34:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 6040. [2020-10-26 22:34:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6040 states. [2020-10-26 22:34:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6040 states to 6040 states and 7382 transitions. [2020-10-26 22:34:45,682 INFO L78 Accepts]: Start accepts. Automaton has 6040 states and 7382 transitions. Word has length 334 [2020-10-26 22:34:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:45,683 INFO L481 AbstractCegarLoop]: Abstraction has 6040 states and 7382 transitions. [2020-10-26 22:34:45,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:34:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6040 states and 7382 transitions. [2020-10-26 22:34:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2020-10-26 22:34:45,697 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:45,698 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:45,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 22:34:45,698 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:45,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:45,699 INFO L82 PathProgramCache]: Analyzing trace with hash -64713384, now seen corresponding path program 1 times [2020-10-26 22:34:45,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:45,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691188325] [2020-10-26 22:34:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 22:34:45,775 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-26 22:34:45,775 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 22:34:45,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-26 22:34:45,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:34:45 BoogieIcfgContainer [2020-10-26 22:34:45,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 22:34:45,867 INFO L168 Benchmark]: Toolchain (without parser) took 47833.01 ms. Allocated memory was 151.0 MB in the beginning and 798.0 MB in the end (delta: 647.0 MB). Free memory was 124.9 MB in the beginning and 606.6 MB in the end (delta: -481.7 MB). Peak memory consumption was 166.0 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:45,868 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 151.0 MB. Free memory is still 126.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-26 22:34:45,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.91 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 130.8 MB in the end (delta: -6.4 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:45,875 INFO L168 Benchmark]: Boogie Preprocessor took 149.82 ms. Allocated memory is still 151.0 MB. Free memory was 130.8 MB in the beginning and 126.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:45,876 INFO L168 Benchmark]: RCFGBuilder took 1751.74 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 126.3 MB in the beginning and 114.6 MB in the end (delta: 11.7 MB). Peak memory consumption was 60.9 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:45,878 INFO L168 Benchmark]: TraceAbstraction took 45130.41 ms. Allocated memory was 181.4 MB in the beginning and 798.0 MB in the end (delta: 616.6 MB). Free memory was 114.1 MB in the beginning and 606.6 MB in the end (delta: -492.6 MB). Peak memory consumption was 123.9 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:45,883 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 151.0 MB. Free memory is still 126.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 784.91 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 130.8 MB in the end (delta: -6.4 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 149.82 ms. Allocated memory is still 151.0 MB. Free memory was 130.8 MB in the beginning and 126.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1751.74 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 126.3 MB in the beginning and 114.6 MB in the end (delta: 11.7 MB). Peak memory consumption was 60.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 45130.41 ms. Allocated memory was 181.4 MB in the beginning and 798.0 MB in the end (delta: 616.6 MB). Free memory was 114.1 MB in the beginning and 606.6 MB in the end (delta: -492.6 MB). Peak memory consumption was 123.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputC = 3; [L10] int inputD = 4; [L11] int inputE = 5; [L12] int inputF = 6; [L13] int inputB = 2; [L16] int a1 = 23; [L17] int a19 = 9; [L18] int a10 = 0; [L19] int a12 = 0; [L20] int a4 = 14; [L581] int output = -1; [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L456] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L462] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L467] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L473] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L478] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L483] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L489] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L495] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L501] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L506] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L511] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L516] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L519] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L525] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L528] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L531] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L536] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L542] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L543] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L544] a10 = 1 [L546] return 25; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L456] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L462] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L463] a1 = (((a1 / 5) + 105416) + 61704) [L464] a10 = 4 [L466] return 24; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND TRUE ((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0))) [L316] a19 = 8 [L318] return -1; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND TRUE (((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L45] CALL reach_error() [L4] __assert_fail("0", "Problem10_label58.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 44.9s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 316 SDtfs, 4562 SDslu, 360 SDs, 0 SdLazy, 9649 SolverSat, 1253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6040occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1105 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 2680 NumberOfCodeBlocks, 2680 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2301 ConstructedInterpolants, 0 QuantifiedInterpolants, 1911000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 1413/1610 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...