/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_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-26 22:33:26,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 22:33:26,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 22:33:27,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 22:33:27,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 22:33:27,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 22:33:27,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 22:33:27,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 22:33:27,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 22:33:27,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 22:33:27,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 22:33:27,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 22:33:27,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 22:33:27,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 22:33:27,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 22:33:27,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 22:33:27,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 22:33:27,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 22:33:27,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 22:33:27,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 22:33:27,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 22:33:27,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 22:33:27,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 22:33:27,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 22:33:27,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 22:33:27,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 22:33:27,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 22:33:27,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 22:33:27,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 22:33:27,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 22:33:27,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 22:33:27,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 22:33:27,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 22:33:27,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 22:33:27,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 22:33:27,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 22:33:27,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 22:33:27,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 22:33:27,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 22:33:27,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 22:33:27,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 22:33:27,082 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:27,110 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 22:33:27,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 22:33:27,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 22:33:27,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 22:33:27,112 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 22:33:27,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 22:33:27,113 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 22:33:27,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 22:33:27,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 22:33:27,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 22:33:27,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 22:33:27,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 22:33:27,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 22:33:27,114 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 22:33:27,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 22:33:27,114 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 22:33:27,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 22:33:27,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 22:33:27,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 22:33:27,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 22:33:27,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 22:33:27,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 22:33:27,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 22:33:27,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 22:33:27,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 22:33:27,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 22:33:27,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 22:33:27,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 22:33:27,117 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 22:33:27,118 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:27,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 22:33:27,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 22:33:27,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 22:33:27,622 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 22:33:27,623 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 22:33:27,624 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label50.c [2020-10-26 22:33:27,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f4fbc06f9/a206229679134865a0b92f79bd94250f/FLAG3521ff4da [2020-10-26 22:33:28,394 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 22:33:28,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label50.c [2020-10-26 22:33:28,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f4fbc06f9/a206229679134865a0b92f79bd94250f/FLAG3521ff4da [2020-10-26 22:33:28,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f4fbc06f9/a206229679134865a0b92f79bd94250f [2020-10-26 22:33:28,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 22:33:28,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-26 22:33:28,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 22:33:28,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 22:33:28,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 22:33:28,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:28" (1/1) ... [2020-10-26 22:33:28,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b37de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:28, skipping insertion in model container [2020-10-26 22:33:28,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:28" (1/1) ... [2020-10-26 22:33:28,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 22:33:28,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 22:33:29,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:33:29,307 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 22:33:29,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:33:29,459 INFO L208 MainTranslator]: Completed translation [2020-10-26 22:33:29,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:29 WrapperNode [2020-10-26 22:33:29,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 22:33:29,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 22:33:29,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 22:33:29,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 22:33:29,478 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:29" (1/1) ... [2020-10-26 22:33:29,478 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:29" (1/1) ... [2020-10-26 22:33:29,500 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:29" (1/1) ... [2020-10-26 22:33:29,500 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:29" (1/1) ... [2020-10-26 22:33:29,555 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:29" (1/1) ... [2020-10-26 22:33:29,566 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:29" (1/1) ... [2020-10-26 22:33:29,574 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:29" (1/1) ... [2020-10-26 22:33:29,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 22:33:29,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 22:33:29,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 22:33:29,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 22:33:29,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:29" (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:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 22:33:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 22:33:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 22:33:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-26 22:33:29,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 22:33:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-26 22:33:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 22:33:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 22:33:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 22:33:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 22:33:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 22:33:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-26 22:33:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 22:33:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 22:33:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 22:33:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 22:33:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 22:33:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 22:33:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 22:33:31,264 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 22:33:31,265 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 22:33:31,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:33:31 BoogieIcfgContainer [2020-10-26 22:33:31,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 22:33:31,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 22:33:31,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 22:33:31,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 22:33:31,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:33:28" (1/3) ... [2020-10-26 22:33:31,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212b673c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:33:31, skipping insertion in model container [2020-10-26 22:33:31,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:29" (2/3) ... [2020-10-26 22:33:31,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212b673c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:33:31, skipping insertion in model container [2020-10-26 22:33:31,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:33:31" (3/3) ... [2020-10-26 22:33:31,276 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label50.c [2020-10-26 22:33:31,289 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-26 22:33:31,294 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-26 22:33:31,308 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-26 22:33:31,339 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 22:33:31,339 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 22:33:31,339 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-26 22:33:31,339 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 22:33:31,339 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 22:33:31,340 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 22:33:31,340 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 22:33:31,340 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 22:33:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-26 22:33:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-26 22:33:31,371 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:31,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:31,373 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:31,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:31,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1820384268, now seen corresponding path program 1 times [2020-10-26 22:33:31,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:31,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2096091600] [2020-10-26 22:33:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:31,578 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:32,039 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:32,040 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 26 [2020-10-26 22:33:32,040 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:32,040 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 495 [2020-10-26 22:33:32,046 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:32,046 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:32,047 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:32,047 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-26 22:33:32,047 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 6 [2020-10-26 22:33:32,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:32,215 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:32,250 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:32,250 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:32,251 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:32,251 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 44 [2020-10-26 22:33:32,251 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:32,251 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:32,251 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:32,253 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:32,253 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:32,279 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:33:32,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2096091600] [2020-10-26 22:33:32,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:33:32,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 22:33:32,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076401296] [2020-10-26 22:33:32,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 22:33:32,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:32,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 22:33:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 22:33:32,316 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-26 22:33:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:34,076 INFO L93 Difference]: Finished difference Result 586 states and 1012 transitions. [2020-10-26 22:33:34,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:33:34,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-26 22:33:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:34,093 INFO L225 Difference]: With dead ends: 586 [2020-10-26 22:33:34,094 INFO L226 Difference]: Without dead ends: 303 [2020-10-26 22:33:34,103 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:33:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-26 22:33:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-10-26 22:33:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-26 22:33:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 396 transitions. [2020-10-26 22:33:34,181 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 396 transitions. Word has length 16 [2020-10-26 22:33:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:34,181 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 396 transitions. [2020-10-26 22:33:34,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 22:33:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 396 transitions. [2020-10-26 22:33:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-26 22:33:34,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:34,187 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-26 22:33:34,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 22:33:34,188 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:34,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1930199696, now seen corresponding path program 1 times [2020-10-26 22:33:34,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:34,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [315235627] [2020-10-26 22:33:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:34,307 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:34,395 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:35,172 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:35,173 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 98 [2020-10-26 22:33:35,174 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:35,174 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 903 [2020-10-26 22:33:35,175 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:35,176 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-26 22:33:35,176 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:35,176 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 89 [2020-10-26 22:33:35,176 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-26 22:33:35,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:35,309 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:35,331 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:35,331 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:35,332 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:35,333 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 27 [2020-10-26 22:33:35,336 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:35,336 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:35,337 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:35,337 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:35,337 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:35,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:35,405 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:35,483 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:35,614 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:35,615 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:35,622 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:35,622 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 224 [2020-10-26 22:33:35,622 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:35,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:35,623 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:35,623 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 71 [2020-10-26 22:33:35,623 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 22:33:35,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [315235627] [2020-10-26 22:33:35,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:35,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:33:35,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851182564] [2020-10-26 22:33:35,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:35,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:35,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:35,754 INFO L87 Difference]: Start difference. First operand 299 states and 396 transitions. Second operand 7 states. [2020-10-26 22:33:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:37,921 INFO L93 Difference]: Finished difference Result 898 states and 1243 transitions. [2020-10-26 22:33:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 22:33:37,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2020-10-26 22:33:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:37,938 INFO L225 Difference]: With dead ends: 898 [2020-10-26 22:33:37,938 INFO L226 Difference]: Without dead ends: 895 [2020-10-26 22:33:37,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-26 22:33:37,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2020-10-26 22:33:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 591. [2020-10-26 22:33:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-26 22:33:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 852 transitions. [2020-10-26 22:33:38,055 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 852 transitions. Word has length 86 [2020-10-26 22:33:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:38,056 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 852 transitions. [2020-10-26 22:33:38,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 852 transitions. [2020-10-26 22:33:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-26 22:33:38,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:38,065 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-26 22:33:38,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 22:33:38,065 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:38,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:38,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1849339292, now seen corresponding path program 1 times [2020-10-26 22:33:38,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:38,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [570430160] [2020-10-26 22:33:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:38,120 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:38,338 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:38,441 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:38,899 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:38,900 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 101 [2020-10-26 22:33:38,900 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:33:38,900 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 800 [2020-10-26 22:33:38,900 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:38,900 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:38,901 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:38,901 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 79 [2020-10-26 22:33:38,901 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:39,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:39,021 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:39,034 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:39,035 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:39,035 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:39,035 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 15 [2020-10-26 22:33:39,037 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:39,037 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:39,038 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:39,038 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:39,038 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:39,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:39,088 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:39,225 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:39,225 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:33:39,225 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:39,226 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 149 [2020-10-26 22:33:39,226 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:39,226 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:39,226 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:39,226 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:39,226 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:33:39,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [570430160] [2020-10-26 22:33:39,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:33:39,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 22:33:39,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912492885] [2020-10-26 22:33:39,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:39,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:39,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:39,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:39,303 INFO L87 Difference]: Start difference. First operand 591 states and 852 transitions. Second operand 7 states. [2020-10-26 22:33:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:41,170 INFO L93 Difference]: Finished difference Result 1492 states and 2183 transitions. [2020-10-26 22:33:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:33:41,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2020-10-26 22:33:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:41,180 INFO L225 Difference]: With dead ends: 1492 [2020-10-26 22:33:41,181 INFO L226 Difference]: Without dead ends: 907 [2020-10-26 22:33:41,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 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:33:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-10-26 22:33:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 889. [2020-10-26 22:33:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2020-10-26 22:33:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1175 transitions. [2020-10-26 22:33:41,240 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1175 transitions. Word has length 89 [2020-10-26 22:33:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:41,240 INFO L481 AbstractCegarLoop]: Abstraction has 889 states and 1175 transitions. [2020-10-26 22:33:41,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1175 transitions. [2020-10-26 22:33:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-26 22:33:41,243 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:41,243 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2020-10-26 22:33:41,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 22:33:41,243 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:41,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2032011664, now seen corresponding path program 1 times [2020-10-26 22:33:41,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:41,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [922059309] [2020-10-26 22:33:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:41,298 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:41,498 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:41,499 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-10-26 22:33:41,499 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:41,499 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 217 [2020-10-26 22:33:41,499 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:41,500 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:41,500 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:33:41,501 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 14 [2020-10-26 22:33:41,502 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-26 22:33:41,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:41,581 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:41,590 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:41,590 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:41,590 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:41,590 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-26 22:33:41,591 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:41,591 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:41,591 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:41,591 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:41,591 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:41,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:41,633 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:41,690 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:41,691 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:33:41,691 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:41,691 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 68 [2020-10-26 22:33:41,691 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:41,691 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:41,691 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:41,692 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:41,692 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:33:41,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [922059309] [2020-10-26 22:33:41,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:41,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:33:41,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321842622] [2020-10-26 22:33:41,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:33:41,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:41,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:33:41,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:33:41,766 INFO L87 Difference]: Start difference. First operand 889 states and 1175 transitions. Second operand 5 states. [2020-10-26 22:33:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:43,220 INFO L93 Difference]: Finished difference Result 2217 states and 3000 transitions. [2020-10-26 22:33:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:33:43,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-10-26 22:33:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:43,232 INFO L225 Difference]: With dead ends: 2217 [2020-10-26 22:33:43,232 INFO L226 Difference]: Without dead ends: 1334 [2020-10-26 22:33:43,235 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:33:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2020-10-26 22:33:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1185. [2020-10-26 22:33:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2020-10-26 22:33:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1508 transitions. [2020-10-26 22:33:43,310 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1508 transitions. Word has length 95 [2020-10-26 22:33:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:43,310 INFO L481 AbstractCegarLoop]: Abstraction has 1185 states and 1508 transitions. [2020-10-26 22:33:43,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:33:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1508 transitions. [2020-10-26 22:33:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-10-26 22:33:43,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:43,322 INFO L422 BasicCegarLoop]: trace histogram [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, 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:33:43,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 22:33:43,323 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:43,323 INFO L82 PathProgramCache]: Analyzing trace with hash 814756076, now seen corresponding path program 1 times [2020-10-26 22:33:43,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:43,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1432409999] [2020-10-26 22:33:43,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:43,402 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:43,584 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:44,283 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:44,310 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:44,311 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 190 [2020-10-26 22:33:44,311 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:33:44,311 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 935 [2020-10-26 22:33:44,311 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:44,311 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:44,312 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:33:44,312 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 106 [2020-10-26 22:33:44,312 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:44,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:44,427 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:44,436 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:44,436 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:44,436 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:44,436 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-10-26 22:33:44,436 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:44,437 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:44,437 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:44,437 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:44,437 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:44,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:44,473 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:44,519 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:44,519 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:44,520 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:44,520 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 54 [2020-10-26 22:33:44,520 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:44,520 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:44,520 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:44,520 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:33:44,520 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:44,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:33:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:44,572 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:44,618 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:44,801 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:44,801 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:33:44,801 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:44,801 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 240 [2020-10-26 22:33:44,801 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:44,802 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:44,802 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:44,802 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-26 22:33:44,802 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 73 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 22:33:44,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1432409999] [2020-10-26 22:33:44,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:44,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:44,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075640391] [2020-10-26 22:33:44,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:44,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:44,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:44,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:44,904 INFO L87 Difference]: Start difference. First operand 1185 states and 1508 transitions. Second operand 7 states. [2020-10-26 22:33:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:46,907 INFO L93 Difference]: Finished difference Result 3407 states and 4444 transitions. [2020-10-26 22:33:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 22:33:46,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 176 [2020-10-26 22:33:46,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:46,923 INFO L225 Difference]: With dead ends: 3407 [2020-10-26 22:33:46,924 INFO L226 Difference]: Without dead ends: 2228 [2020-10-26 22:33:46,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-26 22:33:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2020-10-26 22:33:46,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1348. [2020-10-26 22:33:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2020-10-26 22:33:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1645 transitions. [2020-10-26 22:33:47,007 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1645 transitions. Word has length 176 [2020-10-26 22:33:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:47,009 INFO L481 AbstractCegarLoop]: Abstraction has 1348 states and 1645 transitions. [2020-10-26 22:33:47,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1645 transitions. [2020-10-26 22:33:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-10-26 22:33:47,013 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:47,014 INFO L422 BasicCegarLoop]: trace histogram [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, 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:33:47,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 22:33:47,014 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1450764560, now seen corresponding path program 1 times [2020-10-26 22:33:47,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:47,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [757470768] [2020-10-26 22:33:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:47,070 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:47,326 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:47,484 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:49,534 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:50,588 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:50,588 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 197 [2020-10-26 22:33:50,588 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:33:50,588 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3536 [2020-10-26 22:33:50,588 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:50,589 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:50,589 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:50,589 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 83 [2020-10-26 22:33:50,589 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:50,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:50,679 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:50,689 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:50,689 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:50,689 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:50,689 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-10-26 22:33:50,689 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:50,690 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:50,690 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:50,690 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:50,690 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:50,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:50,729 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:50,828 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:50,828 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:33:50,828 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:50,829 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 109 [2020-10-26 22:33:50,829 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:50,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:50,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:50,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-26 22:33:50,829 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:50,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-26 22:33:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:50,952 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:51,007 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:51,007 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:33:51,008 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:51,008 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 66 [2020-10-26 22:33:51,008 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:51,008 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:51,008 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-10-26 22:33:51,008 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:51,009 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-26 22:33:51,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [757470768] [2020-10-26 22:33:51,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:51,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:51,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686351735] [2020-10-26 22:33:51,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:51,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:51,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:51,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:51,112 INFO L87 Difference]: Start difference. First operand 1348 states and 1645 transitions. Second operand 7 states. [2020-10-26 22:33:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:52,852 INFO L93 Difference]: Finished difference Result 3286 states and 3982 transitions. [2020-10-26 22:33:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:33:52,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 183 [2020-10-26 22:33:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:52,866 INFO L225 Difference]: With dead ends: 3286 [2020-10-26 22:33:52,866 INFO L226 Difference]: Without dead ends: 1799 [2020-10-26 22:33:52,872 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:33:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2020-10-26 22:33:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1783. [2020-10-26 22:33:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2020-10-26 22:33:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2129 transitions. [2020-10-26 22:33:52,956 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2129 transitions. Word has length 183 [2020-10-26 22:33:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:52,956 INFO L481 AbstractCegarLoop]: Abstraction has 1783 states and 2129 transitions. [2020-10-26 22:33:52,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2129 transitions. [2020-10-26 22:33:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-10-26 22:33:52,963 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:52,963 INFO L422 BasicCegarLoop]: trace histogram [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, 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:33:52,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 22:33:52,964 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:52,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:52,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2036683248, now seen corresponding path program 1 times [2020-10-26 22:33:52,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:52,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [803847858] [2020-10-26 22:33:52,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:53,062 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:53,286 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:53,950 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:54,021 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:54,022 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 250 [2020-10-26 22:33:54,022 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:33:54,022 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 994 [2020-10-26 22:33:54,022 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:54,022 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:54,022 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:33:54,022 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 144 [2020-10-26 22:33:54,023 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:54,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:54,114 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:54,123 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:54,123 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:54,123 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:54,123 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-26 22:33:54,124 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:54,124 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:54,124 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:54,124 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:54,124 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:54,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:54,158 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:54,207 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:54,207 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:33:54,208 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:54,208 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-10-26 22:33:54,208 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:54,208 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:54,208 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:54,208 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:54,209 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:54,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-26 22:33:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:54,285 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:54,450 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:54,451 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-26 22:33:54,451 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:54,451 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 184 [2020-10-26 22:33:54,451 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:54,451 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:54,451 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:54,452 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-26 22:33:54,452 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:54,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [803847858] [2020-10-26 22:33:54,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:54,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:54,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714877101] [2020-10-26 22:33:54,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:54,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:54,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:54,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:54,646 INFO L87 Difference]: Start difference. First operand 1783 states and 2129 transitions. Second operand 7 states. [2020-10-26 22:33:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:57,025 INFO L93 Difference]: Finished difference Result 4283 states and 5176 transitions. [2020-10-26 22:33:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 22:33:57,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 236 [2020-10-26 22:33:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:57,042 INFO L225 Difference]: With dead ends: 4283 [2020-10-26 22:33:57,042 INFO L226 Difference]: Without dead ends: 2214 [2020-10-26 22:33:57,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:33:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2020-10-26 22:33:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1779. [2020-10-26 22:33:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2020-10-26 22:33:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2030 transitions. [2020-10-26 22:33:57,113 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2030 transitions. Word has length 236 [2020-10-26 22:33:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:57,114 INFO L481 AbstractCegarLoop]: Abstraction has 1779 states and 2030 transitions. [2020-10-26 22:33:57,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2030 transitions. [2020-10-26 22:33:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2020-10-26 22:33:57,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:57,120 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-26 22:33:57,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 22:33:57,120 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash 158409708, now seen corresponding path program 1 times [2020-10-26 22:33:57,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:57,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [287961317] [2020-10-26 22:33:57,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:57,207 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:57,280 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:57,931 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:00,305 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:00,472 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:00,473 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 269 [2020-10-26 22:34:00,473 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:34:00,474 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3297 [2020-10-26 22:34:00,474 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:00,474 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:00,474 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:34:00,475 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-26 22:34:00,475 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:00,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:00,562 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:00,568 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:00,568 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:00,569 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:00,569 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:34:00,569 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:00,569 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:00,570 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:00,570 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:00,570 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:34:00,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:00,612 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:00,657 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:00,657 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:34:00,657 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:00,657 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 55 [2020-10-26 22:34:00,657 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:00,658 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:00,658 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:00,658 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:34:00,658 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:00,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:34:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:00,713 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:00,838 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:00,838 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:34:00,838 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:00,839 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 136 [2020-10-26 22:34:00,839 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:00,839 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:00,839 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:00,839 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-26 22:34:00,839 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:00,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-10-26 22:34:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:00,982 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:01,020 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:01,020 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-26 22:34:01,020 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:01,021 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 49 [2020-10-26 22:34:01,021 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:01,021 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:01,021 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-10-26 22:34:01,021 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:01,021 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 95 proven. 76 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-26 22:34:01,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [287961317] [2020-10-26 22:34:01,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:01,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:34:01,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743515200] [2020-10-26 22:34:01,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:34:01,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:01,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:34:01,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:01,151 INFO L87 Difference]: Start difference. First operand 1779 states and 2030 transitions. Second operand 7 states. [2020-10-26 22:34:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:02,967 INFO L93 Difference]: Finished difference Result 3870 states and 4467 transitions. [2020-10-26 22:34:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:34:02,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 253 [2020-10-26 22:34:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:02,980 INFO L225 Difference]: With dead ends: 3870 [2020-10-26 22:34:02,980 INFO L226 Difference]: Without dead ends: 2240 [2020-10-26 22:34:02,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:34:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2020-10-26 22:34:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1936. [2020-10-26 22:34:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2020-10-26 22:34:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2202 transitions. [2020-10-26 22:34:03,054 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2202 transitions. Word has length 253 [2020-10-26 22:34:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:03,055 INFO L481 AbstractCegarLoop]: Abstraction has 1936 states and 2202 transitions. [2020-10-26 22:34:03,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:34:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2202 transitions. [2020-10-26 22:34:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-10-26 22:34:03,061 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:03,061 INFO L422 BasicCegarLoop]: trace histogram [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, 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:03,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 22:34:03,062 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash -827457192, now seen corresponding path program 1 times [2020-10-26 22:34:03,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:03,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1882882556] [2020-10-26 22:34:03,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:03,203 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,643 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:03,643 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 286 [2020-10-26 22:34:03,643 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:03,644 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 498 [2020-10-26 22:34:03,644 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:03,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:03,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 268 [2020-10-26 22:34:03,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 14 [2020-10-26 22:34:03,645 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:03,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:03,754 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,759 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:03,760 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:03,760 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:03,760 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-26 22:34:03,760 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:03,761 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:03,761 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:03,761 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:03,761 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:03,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:03,785 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:03,825 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:03,825 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:03,826 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:03,826 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 41 [2020-10-26 22:34:03,826 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:03,826 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:03,826 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:03,827 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:03,827 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:03,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:03,923 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:04,030 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:04,030 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-26 22:34:04,031 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:04,031 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 129 [2020-10-26 22:34:04,031 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:04,031 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:04,031 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:04,032 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 136 [2020-10-26 22:34:04,032 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-10-26 22:34:04,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1882882556] [2020-10-26 22:34:04,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:04,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:34:04,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361629970] [2020-10-26 22:34:04,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:34:04,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:04,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:34:04,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:34:04,152 INFO L87 Difference]: Start difference. First operand 1936 states and 2202 transitions. Second operand 5 states. [2020-10-26 22:34:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:05,725 INFO L93 Difference]: Finished difference Result 4162 states and 4795 transitions. [2020-10-26 22:34:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:34:05,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 272 [2020-10-26 22:34:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:05,738 INFO L225 Difference]: With dead ends: 4162 [2020-10-26 22:34:05,739 INFO L226 Difference]: Without dead ends: 2226 [2020-10-26 22:34:05,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2020-10-26 22:34:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2222. [2020-10-26 22:34:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2020-10-26 22:34:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2521 transitions. [2020-10-26 22:34:05,823 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2521 transitions. Word has length 272 [2020-10-26 22:34:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:05,824 INFO L481 AbstractCegarLoop]: Abstraction has 2222 states and 2521 transitions. [2020-10-26 22:34:05,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:34:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2521 transitions. [2020-10-26 22:34:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2020-10-26 22:34:05,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:05,830 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-26 22:34:05,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 22:34:05,831 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:05,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:05,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1820223264, now seen corresponding path program 1 times [2020-10-26 22:34:05,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:05,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1305358942] [2020-10-26 22:34:05,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:05,929 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:06,005 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:06,151 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:08,096 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,388 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:10,389 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 292 [2020-10-26 22:34:10,389 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-26 22:34:10,389 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4495 [2020-10-26 22:34:10,390 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:10,390 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:34:10,390 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:34:10,390 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 150 [2020-10-26 22:34:10,390 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:10,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:10,504 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,508 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:10,508 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:10,508 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:10,509 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:34:10,509 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:10,509 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:10,509 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:10,509 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:10,510 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:10,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:10,564 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,644 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:10,644 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:10,645 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:10,645 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 97 [2020-10-26 22:34:10,645 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:10,645 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:10,645 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:10,645 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:34:10,646 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:10,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:10,746 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:10,853 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:10,854 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-26 22:34:10,854 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:10,854 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 121 [2020-10-26 22:34:10,855 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:10,855 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:10,855 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:10,856 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-26 22:34:10,856 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:34:11,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-10-26 22:34:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:11,070 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:11,200 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:11,200 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:34:11,200 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:11,200 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 143 [2020-10-26 22:34:11,200 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:11,201 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:11,201 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:11,201 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:34:11,201 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 228 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-26 22:34:11,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1305358942] [2020-10-26 22:34:11,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:11,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-26 22:34:11,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049077927] [2020-10-26 22:34:11,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 22:34:11,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:11,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 22:34:11,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:34:11,682 INFO L87 Difference]: Start difference. First operand 2222 states and 2521 transitions. Second operand 8 states. [2020-10-26 22:34:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:13,830 INFO L93 Difference]: Finished difference Result 4619 states and 5365 transitions. [2020-10-26 22:34:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-26 22:34:13,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 276 [2020-10-26 22:34:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:13,843 INFO L225 Difference]: With dead ends: 4619 [2020-10-26 22:34:13,843 INFO L226 Difference]: Without dead ends: 2546 [2020-10-26 22:34:13,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2020-10-26 22:34:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2020-10-26 22:34:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2528. [2020-10-26 22:34:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2020-10-26 22:34:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 2857 transitions. [2020-10-26 22:34:13,930 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 2857 transitions. Word has length 276 [2020-10-26 22:34:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:13,931 INFO L481 AbstractCegarLoop]: Abstraction has 2528 states and 2857 transitions. [2020-10-26 22:34:13,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 22:34:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 2857 transitions. [2020-10-26 22:34:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2020-10-26 22:34:13,938 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:13,938 INFO L422 BasicCegarLoop]: trace histogram [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, 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:13,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 22:34:13,939 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:13,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash -626651296, now seen corresponding path program 1 times [2020-10-26 22:34:13,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:13,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1311983372] [2020-10-26 22:34:13,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:14,054 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:14,139 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,321 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:15,966 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:15,966 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 305 [2020-10-26 22:34:15,967 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:34:15,967 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1953 [2020-10-26 22:34:15,967 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:15,967 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:15,967 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 212 [2020-10-26 22:34:15,968 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-26 22:34:15,968 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:16,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:16,079 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:16,082 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:16,083 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:16,083 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:16,083 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-26 22:34:16,083 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:16,083 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:16,083 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:16,084 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:16,084 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:16,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:16,105 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:16,175 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:16,176 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:34:16,176 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:16,176 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 71 [2020-10-26 22:34:16,176 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:16,176 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:16,176 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:16,177 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:16,177 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:16,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:34:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:16,234 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:16,287 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:16,288 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 86 [2020-10-26 22:34:16,288 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:16,288 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 63 [2020-10-26 22:34:16,288 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:16,288 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:16,289 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:16,289 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-26 22:34:16,289 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:16,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-10-26 22:34:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:16,336 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:16,415 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:16,416 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:34:16,416 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:16,416 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 88 [2020-10-26 22:34:16,416 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:16,416 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:16,417 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:16,417 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:34:16,417 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-26 22:34:16,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1311983372] [2020-10-26 22:34:16,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:16,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:34:16,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594511535] [2020-10-26 22:34:16,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:34:16,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:16,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:34:16,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:34:16,605 INFO L87 Difference]: Start difference. First operand 2528 states and 2857 transitions. Second operand 7 states. [2020-10-26 22:34:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:18,406 INFO L93 Difference]: Finished difference Result 5217 states and 5989 transitions. [2020-10-26 22:34:18,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:34:18,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 289 [2020-10-26 22:34:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:18,422 INFO L225 Difference]: With dead ends: 5217 [2020-10-26 22:34:18,422 INFO L226 Difference]: Without dead ends: 2838 [2020-10-26 22:34:18,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:34:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2020-10-26 22:34:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2820. [2020-10-26 22:34:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2020-10-26 22:34:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3199 transitions. [2020-10-26 22:34:18,550 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3199 transitions. Word has length 289 [2020-10-26 22:34:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:18,551 INFO L481 AbstractCegarLoop]: Abstraction has 2820 states and 3199 transitions. [2020-10-26 22:34:18,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:34:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3199 transitions. [2020-10-26 22:34:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2020-10-26 22:34:18,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:18,562 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:34:18,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 22:34:18,562 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:18,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:18,563 INFO L82 PathProgramCache]: Analyzing trace with hash 799905992, now seen corresponding path program 1 times [2020-10-26 22:34:18,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:18,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [652121584] [2020-10-26 22:34:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:18,689 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:19,241 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:19,613 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:19,613 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 344 [2020-10-26 22:34:19,614 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:19,614 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 973 [2020-10-26 22:34:19,614 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:19,614 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:34:19,614 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 326 [2020-10-26 22:34:19,614 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 12 [2020-10-26 22:34:19,615 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:19,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:19,754 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:19,758 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:19,758 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:19,759 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:19,759 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:34:19,759 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:19,759 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:19,759 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:19,760 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:19,760 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:19,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:19,784 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:19,827 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:19,828 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 138 [2020-10-26 22:34:19,828 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:19,828 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 44 [2020-10-26 22:34:19,828 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:19,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:19,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:19,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:19,829 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:19,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-10-26 22:34:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:19,883 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:19,910 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:19,910 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 103 [2020-10-26 22:34:19,910 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:19,911 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 28 [2020-10-26 22:34:19,911 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:19,911 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:19,911 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:19,911 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:19,911 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:19,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-10-26 22:34:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:19,966 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:20,013 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:20,013 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-26 22:34:20,013 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:20,014 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 56 [2020-10-26 22:34:20,014 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:20,014 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:20,014 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:20,014 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 68 [2020-10-26 22:34:20,014 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2020-10-26 22:34:20,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [652121584] [2020-10-26 22:34:20,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:20,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:34:20,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969554327] [2020-10-26 22:34:20,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:34:20,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:34:20,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:34:20,236 INFO L87 Difference]: Start difference. First operand 2820 states and 3199 transitions. Second operand 5 states. [2020-10-26 22:34:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:21,206 INFO L93 Difference]: Finished difference Result 2975 states and 3356 transitions. [2020-10-26 22:34:21,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:34:21,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 328 [2020-10-26 22:34:21,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:21,220 INFO L225 Difference]: With dead ends: 2975 [2020-10-26 22:34:21,221 INFO L226 Difference]: Without dead ends: 2820 [2020-10-26 22:34:21,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 1 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:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2020-10-26 22:34:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2818. [2020-10-26 22:34:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-10-26 22:34:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3192 transitions. [2020-10-26 22:34:21,307 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3192 transitions. Word has length 328 [2020-10-26 22:34:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:21,308 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 3192 transitions. [2020-10-26 22:34:21,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:34:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3192 transitions. [2020-10-26 22:34:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-10-26 22:34:21,319 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:21,319 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-26 22:34:21,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-26 22:34:21,320 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:21,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1422870780, now seen corresponding path program 1 times [2020-10-26 22:34:21,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:21,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120292408] [2020-10-26 22:34:21,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:21,450 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:21,923 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:23,076 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:23,076 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 385 [2020-10-26 22:34:23,077 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:23,077 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1675 [2020-10-26 22:34:23,077 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:23,077 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 11 [2020-10-26 22:34:23,077 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 223 [2020-10-26 22:34:23,077 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 133 [2020-10-26 22:34:23,078 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:23,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:34:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:23,257 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:23,262 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:23,262 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:34:23,262 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:23,262 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:34:23,262 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:23,263 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:23,263 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:23,263 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:23,263 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:23,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:34:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:23,294 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:23,331 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:23,331 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 135 [2020-10-26 22:34:23,331 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:23,331 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 38 [2020-10-26 22:34:23,332 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:23,332 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:34:23,332 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:23,332 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:34:23,332 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:23,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-26 22:34:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:23,398 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:23,452 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:23,452 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-26 22:34:23,452 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:34:23,452 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 64 [2020-10-26 22:34:23,453 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:23,453 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:34:23,453 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:34:23,453 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-26 22:34:23,453 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:23,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-10-26 22:34:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:34:23,526 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:23,640 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:34:24,118 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:34:24,119 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-10-26 22:34:24,119 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:34:24,119 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 611 [2020-10-26 22:34:24,119 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:34:24,119 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 10 [2020-10-26 22:34:24,120 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:34:24,120 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 143 [2020-10-26 22:34:24,120 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:34:24,653 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2020-10-26 22:34:24,861 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2020-10-26 22:34:25,089 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2020-10-26 22:34:25,341 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2020-10-26 22:34:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 234 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-10-26 22:34:26,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120292408] [2020-10-26 22:34:26,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:34:26,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-26 22:34:26,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126073419] [2020-10-26 22:34:26,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 22:34:26,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:34:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 22:34:26,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:34:26,464 INFO L87 Difference]: Start difference. First operand 2818 states and 3192 transitions. Second operand 12 states. [2020-10-26 22:34:26,638 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2020-10-26 22:34:27,349 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2020-10-26 22:34:27,821 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 104 [2020-10-26 22:34:28,221 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 109 [2020-10-26 22:34:28,780 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 107 [2020-10-26 22:34:29,173 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 114 [2020-10-26 22:34:29,751 WARN L193 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2020-10-26 22:34:30,038 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2020-10-26 22:34:30,264 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 50 [2020-10-26 22:34:30,567 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2020-10-26 22:34:31,274 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2020-10-26 22:34:31,814 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 85 [2020-10-26 22:34:32,385 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 88 [2020-10-26 22:34:32,780 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 93 [2020-10-26 22:34:33,523 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 88 [2020-10-26 22:34:33,956 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 88 [2020-10-26 22:34:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:34:34,191 INFO L93 Difference]: Finished difference Result 5644 states and 6464 transitions. [2020-10-26 22:34:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-26 22:34:34,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 369 [2020-10-26 22:34:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:34:34,211 INFO L225 Difference]: With dead ends: 5644 [2020-10-26 22:34:34,211 INFO L226 Difference]: Without dead ends: 2960 [2020-10-26 22:34:34,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2020-10-26 22:34:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-10-26 22:34:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2954. [2020-10-26 22:34:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2020-10-26 22:34:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3341 transitions. [2020-10-26 22:34:34,299 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3341 transitions. Word has length 369 [2020-10-26 22:34:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:34:34,300 INFO L481 AbstractCegarLoop]: Abstraction has 2954 states and 3341 transitions. [2020-10-26 22:34:34,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 22:34:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3341 transitions. [2020-10-26 22:34:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2020-10-26 22:34:34,312 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:34:34,312 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 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:34,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-26 22:34:34,313 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:34:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:34:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1072516052, now seen corresponding path program 1 times [2020-10-26 22:34:34,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:34:34,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [839607435] [2020-10-26 22:34:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:34:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 22:34:34,396 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-26 22:34:34,396 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 22:34:34,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-26 22:34:34,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:34:34 BoogieIcfgContainer [2020-10-26 22:34:34,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 22:34:34,457 INFO L168 Benchmark]: Toolchain (without parser) took 65772.03 ms. Allocated memory was 151.0 MB in the beginning and 1.0 GB in the end (delta: 853.5 MB). Free memory was 124.1 MB in the beginning and 760.4 MB in the end (delta: -636.2 MB). Peak memory consumption was 218.1 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:34,457 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 125.8 MB. Free memory is still 80.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-26 22:34:34,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.42 ms. Allocated memory is still 151.0 MB. Free memory was 123.5 MB in the beginning and 96.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:34,458 INFO L168 Benchmark]: Boogie Preprocessor took 124.22 ms. Allocated memory is still 151.0 MB. Free memory was 96.9 MB in the beginning and 92.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:34,459 INFO L168 Benchmark]: RCFGBuilder took 1680.51 ms. Allocated memory is still 151.0 MB. Free memory was 92.2 MB in the beginning and 80.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 19.3 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:34,460 INFO L168 Benchmark]: TraceAbstraction took 63185.98 ms. Allocated memory was 151.0 MB in the beginning and 1.0 GB in the end (delta: 853.5 MB). Free memory was 80.4 MB in the beginning and 760.4 MB in the end (delta: -679.9 MB). Peak memory consumption was 173.6 MB. Max. memory is 8.0 GB. [2020-10-26 22:34:34,462 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.29 ms. Allocated memory is still 125.8 MB. Free memory is still 80.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 765.42 ms. Allocated memory is still 151.0 MB. Free memory was 123.5 MB in the beginning and 96.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 124.22 ms. Allocated memory is still 151.0 MB. Free memory was 96.9 MB in the beginning and 92.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1680.51 ms. Allocated memory is still 151.0 MB. Free memory was 92.2 MB in the beginning and 80.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 19.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 63185.98 ms. Allocated memory was 151.0 MB in the beginning and 1.0 GB in the end (delta: 853.5 MB). Free memory was 80.4 MB in the beginning and 760.4 MB in the end (delta: -679.9 MB). Peak memory consumption was 173.6 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 TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L529] a1 = (((a1 * 5) + 278443) - -239546) [L530] return 26; [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 TRUE (((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9)) [L338] a1 = ((((((a1 / 5) % 25)+ 13) * 5) % 25)- -12) [L339] a10 = 4 [L341] return 22; [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 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 FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L547] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L550] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L556] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L559] COND FALSE !(((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14)))) [L565] COND TRUE ((a4==14) && ((((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a12==0)) && (a19==9)) && (a10==4))) [L566] a1 = (((a1 + 566454) + 1842) + 23814) [L567] a10 = 2 [L568] a19 = 8 [L570] 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 TRUE (((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L33] CALL reach_error() [L4] __assert_fail("0", "Problem10_label50.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: 63.0s, OverallIterations: 14, TraceHistogramMax: 4, AutomataDifference: 29.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 344 SDtfs, 5294 SDslu, 426 SDs, 0 SdLazy, 12560 SolverSat, 1699 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2954occurred in iteration=13, 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, 13 MinimizatonAttempts, 2158 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 3056 NumberOfCodeBlocks, 3056 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2655 ConstructedInterpolants, 0 QuantifiedInterpolants, 5149612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 1571/1750 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...