/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_label41.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-26 22:32:51,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 22:32:51,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 22:32:51,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 22:32:51,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 22:32:51,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 22:32:51,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 22:32:51,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 22:32:51,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 22:32:51,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 22:32:51,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 22:32:51,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 22:32:51,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 22:32:51,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 22:32:51,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 22:32:51,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 22:32:51,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 22:32:51,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 22:32:51,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 22:32:51,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 22:32:51,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 22:32:51,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 22:32:51,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 22:32:51,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 22:32:51,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 22:32:51,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 22:32:51,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 22:32:51,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 22:32:51,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 22:32:51,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 22:32:51,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 22:32:51,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 22:32:51,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 22:32:51,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 22:32:51,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 22:32:51,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 22:32:51,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 22:32:51,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 22:32:51,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 22:32:51,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 22:32:51,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 22:32:51,300 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:32:51,327 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 22:32:51,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 22:32:51,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 22:32:51,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 22:32:51,330 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 22:32:51,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 22:32:51,330 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 22:32:51,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 22:32:51,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 22:32:51,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 22:32:51,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 22:32:51,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 22:32:51,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 22:32:51,332 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 22:32:51,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 22:32:51,332 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 22:32:51,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 22:32:51,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 22:32:51,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 22:32:51,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 22:32:51,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 22:32:51,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 22:32:51,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 22:32:51,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 22:32:51,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 22:32:51,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 22:32:51,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 22:32:51,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 22:32:51,335 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 22:32:51,335 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:32:51,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 22:32:51,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 22:32:51,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 22:32:51,776 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 22:32:51,777 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 22:32:51,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label41.c [2020-10-26 22:32:51,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a6f2cfd05/1478011d2bff43f9bef6bc22d20c024d/FLAG0a4d7d031 [2020-10-26 22:32:52,549 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 22:32:52,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label41.c [2020-10-26 22:32:52,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a6f2cfd05/1478011d2bff43f9bef6bc22d20c024d/FLAG0a4d7d031 [2020-10-26 22:32:52,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a6f2cfd05/1478011d2bff43f9bef6bc22d20c024d [2020-10-26 22:32:52,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 22:32:52,819 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-26 22:32:52,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 22:32:52,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 22:32:52,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 22:32:52,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:32:52" (1/1) ... [2020-10-26 22:32:52,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f49136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:52, skipping insertion in model container [2020-10-26 22:32:52,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:32:52" (1/1) ... [2020-10-26 22:32:52,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 22:32:52,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 22:32:53,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:32:53,356 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 22:32:53,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:32:53,563 INFO L208 MainTranslator]: Completed translation [2020-10-26 22:32:53,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:53 WrapperNode [2020-10-26 22:32:53,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 22:32:53,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 22:32:53,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 22:32:53,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 22:32:53,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:53" (1/1) ... [2020-10-26 22:32:53,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:53" (1/1) ... [2020-10-26 22:32:53,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:53" (1/1) ... [2020-10-26 22:32:53,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:53" (1/1) ... [2020-10-26 22:32:53,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:53" (1/1) ... [2020-10-26 22:32:53,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:53" (1/1) ... [2020-10-26 22:32:53,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:53" (1/1) ... [2020-10-26 22:32:53,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 22:32:53,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 22:32:53,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 22:32:53,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 22:32:53,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:53" (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:32:53,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 22:32:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 22:32:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 22:32:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-26 22:32:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 22:32:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-26 22:32:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 22:32:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 22:32:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 22:32:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 22:32:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 22:32:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-26 22:32:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 22:32:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 22:32:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 22:32:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 22:32:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 22:32:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 22:32:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 22:32:55,221 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 22:32:55,221 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 22:32:55,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:32:55 BoogieIcfgContainer [2020-10-26 22:32:55,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 22:32:55,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 22:32:55,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 22:32:55,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 22:32:55,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:32:52" (1/3) ... [2020-10-26 22:32:55,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340dec39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:32:55, skipping insertion in model container [2020-10-26 22:32:55,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:32:53" (2/3) ... [2020-10-26 22:32:55,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340dec39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:32:55, skipping insertion in model container [2020-10-26 22:32:55,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:32:55" (3/3) ... [2020-10-26 22:32:55,233 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label41.c [2020-10-26 22:32:55,246 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-26 22:32:55,253 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-26 22:32:55,267 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-26 22:32:55,298 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 22:32:55,298 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 22:32:55,298 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-26 22:32:55,298 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 22:32:55,299 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 22:32:55,299 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 22:32:55,299 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 22:32:55,299 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 22:32:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-26 22:32:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 22:32:55,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:32:55,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:32:55,334 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:32:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:32:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2022893322, now seen corresponding path program 1 times [2020-10-26 22:32:55,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:32:55,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1488360371] [2020-10-26 22:32:55,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:32:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:32:55,573 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:32:56,151 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:32:56,152 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 37 [2020-10-26 22:32:56,152 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:32:56,152 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 630 [2020-10-26 22:32:56,155 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:32:56,155 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:32:56,155 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:32:56,156 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 28 [2020-10-26 22:32:56,156 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-26 22:32:56,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:32:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:32:56,353 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:32:56,383 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:32:56,384 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:32:56,384 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:32:56,384 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 35 [2020-10-26 22:32:56,384 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:32:56,385 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:32:56,386 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:32:56,386 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:32:56,386 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:32:56,405 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:32:56,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1488360371] [2020-10-26 22:32:56,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:32:56,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 22:32:56,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615705152] [2020-10-26 22:32:56,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 22:32:56,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:32:56,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 22:32:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 22:32:56,446 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-26 22:32:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:32:58,537 INFO L93 Difference]: Finished difference Result 586 states and 1013 transitions. [2020-10-26 22:32:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:32:58,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-26 22:32:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:32:58,556 INFO L225 Difference]: With dead ends: 586 [2020-10-26 22:32:58,556 INFO L226 Difference]: Without dead ends: 303 [2020-10-26 22:32:58,565 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:32:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-26 22:32:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2020-10-26 22:32:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-10-26 22:32:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 424 transitions. [2020-10-26 22:32:58,645 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 424 transitions. Word has length 27 [2020-10-26 22:32:58,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:32:58,646 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 424 transitions. [2020-10-26 22:32:58,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 22:32:58,646 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 424 transitions. [2020-10-26 22:32:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-26 22:32:58,652 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:32:58,653 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-26 22:32:58,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 22:32:58,653 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:32:58,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:32:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1730865675, now seen corresponding path program 1 times [2020-10-26 22:32:58,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:32:58,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1167958727] [2020-10-26 22:32:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:32:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:32:58,717 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:32:58,918 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:32:59,639 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:32:59,765 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:32:59,765 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 111 [2020-10-26 22:32:59,766 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:32:59,766 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1069 [2020-10-26 22:32:59,767 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:32:59,767 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-26 22:32:59,768 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:32:59,768 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 102 [2020-10-26 22:32:59,768 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:32:59,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:32:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:32:59,875 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:32:59,890 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:32:59,891 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:32:59,892 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:32:59,895 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 19 [2020-10-26 22:32:59,896 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:32:59,896 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:32:59,896 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:32:59,896 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:32:59,896 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:32:59,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:32:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:32:59,961 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:00,059 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:00,093 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:00,100 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-26 22:33:00,100 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:00,101 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 146 [2020-10-26 22:33:00,101 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:00,101 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:00,101 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:00,101 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-26 22:33:00,102 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 22:33:00,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1167958727] [2020-10-26 22:33:00,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:00,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:33:00,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801036889] [2020-10-26 22:33:00,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:00,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:00,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:00,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:00,252 INFO L87 Difference]: Start difference. First operand 297 states and 424 transitions. Second operand 7 states. [2020-10-26 22:33:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:01,708 INFO L93 Difference]: Finished difference Result 743 states and 1056 transitions. [2020-10-26 22:33:01,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 22:33:01,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2020-10-26 22:33:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:01,713 INFO L225 Difference]: With dead ends: 743 [2020-10-26 22:33:01,713 INFO L226 Difference]: Without dead ends: 452 [2020-10-26 22:33:01,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-26 22:33:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-26 22:33:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 446. [2020-10-26 22:33:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-10-26 22:33:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 602 transitions. [2020-10-26 22:33:01,788 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 602 transitions. Word has length 99 [2020-10-26 22:33:01,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:01,789 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 602 transitions. [2020-10-26 22:33:01,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 602 transitions. [2020-10-26 22:33:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-26 22:33:01,799 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:01,799 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-26 22:33:01,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 22:33:01,799 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:01,802 INFO L82 PathProgramCache]: Analyzing trace with hash -6243867, now seen corresponding path program 1 times [2020-10-26 22:33:01,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:01,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [940951313] [2020-10-26 22:33:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:01,889 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:02,171 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:02,172 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-26 22:33:02,172 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:02,172 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 306 [2020-10-26 22:33:02,172 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:02,172 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:02,172 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:33:02,172 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-26 22:33:02,173 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:02,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:02,277 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:02,282 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:02,283 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:02,283 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:02,283 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:33:02,283 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:02,285 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:02,285 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:02,285 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:02,286 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-26 22:33:02,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:02,342 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:02,434 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:02,435 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:33:02,435 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:02,435 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 105 [2020-10-26 22:33:02,435 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:02,435 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:02,435 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:02,436 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:02,436 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:33:02,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [940951313] [2020-10-26 22:33:02,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:02,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:33:02,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464699467] [2020-10-26 22:33:02,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:33:02,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:02,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:33:02,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:33:02,494 INFO L87 Difference]: Start difference. First operand 446 states and 602 transitions. Second operand 5 states. [2020-10-26 22:33:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:04,010 INFO L93 Difference]: Finished difference Result 1039 states and 1480 transitions. [2020-10-26 22:33:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:33:04,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2020-10-26 22:33:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:04,020 INFO L225 Difference]: With dead ends: 1039 [2020-10-26 22:33:04,020 INFO L226 Difference]: Without dead ends: 742 [2020-10-26 22:33:04,022 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:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2020-10-26 22:33:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2020-10-26 22:33:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-10-26 22:33:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1029 transitions. [2020-10-26 22:33:04,077 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1029 transitions. Word has length 106 [2020-10-26 22:33:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:04,078 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1029 transitions. [2020-10-26 22:33:04,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:33:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1029 transitions. [2020-10-26 22:33:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-10-26 22:33:04,088 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:04,088 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-26 22:33:04,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 22:33:04,089 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:04,089 INFO L82 PathProgramCache]: Analyzing trace with hash -30223191, now seen corresponding path program 1 times [2020-10-26 22:33:04,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:04,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [644399103] [2020-10-26 22:33:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:04,172 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:04,448 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:05,155 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:05,155 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-26 22:33:05,155 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:05,156 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1008 [2020-10-26 22:33:05,156 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:05,156 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:33:05,156 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:33:05,158 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 87 [2020-10-26 22:33:05,159 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-26 22:33:05,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:05,255 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:05,266 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:05,267 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:05,267 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:05,267 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 13 [2020-10-26 22:33:05,267 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:05,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:05,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:05,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:33:05,268 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:05,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:05,327 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:05,446 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:05,446 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 82 [2020-10-26 22:33:05,447 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:05,447 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 130 [2020-10-26 22:33:05,447 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:05,447 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:05,447 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:05,447 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-26 22:33:05,448 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:33:05,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [644399103] [2020-10-26 22:33:05,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:33:05,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 22:33:05,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338399206] [2020-10-26 22:33:05,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:05,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:05,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:05,587 INFO L87 Difference]: Start difference. First operand 740 states and 1029 transitions. Second operand 7 states. [2020-10-26 22:33:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:07,272 INFO L93 Difference]: Finished difference Result 1357 states and 1921 transitions. [2020-10-26 22:33:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:33:07,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2020-10-26 22:33:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:07,282 INFO L225 Difference]: With dead ends: 1357 [2020-10-26 22:33:07,283 INFO L226 Difference]: Without dead ends: 766 [2020-10-26 22:33:07,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:33:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2020-10-26 22:33:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 748. [2020-10-26 22:33:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2020-10-26 22:33:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 910 transitions. [2020-10-26 22:33:07,328 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 910 transitions. Word has length 108 [2020-10-26 22:33:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:07,330 INFO L481 AbstractCegarLoop]: Abstraction has 748 states and 910 transitions. [2020-10-26 22:33:07,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 910 transitions. [2020-10-26 22:33:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-10-26 22:33:07,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:07,334 INFO L422 BasicCegarLoop]: trace histogram [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, 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:07,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 22:33:07,334 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1110884084, now seen corresponding path program 1 times [2020-10-26 22:33:07,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:07,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [36382398] [2020-10-26 22:33:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:07,426 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:07,597 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:08,267 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:08,267 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 192 [2020-10-26 22:33:08,268 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:08,268 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 884 [2020-10-26 22:33:08,268 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:08,268 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:08,268 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-26 22:33:08,269 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 84 [2020-10-26 22:33:08,269 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:08,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:08,371 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:08,379 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:08,379 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:08,380 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:08,380 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-26 22:33:08,380 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:08,380 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:08,381 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:08,381 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:08,381 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:08,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:08,447 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:08,494 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:08,494 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:08,495 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:08,495 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 56 [2020-10-26 22:33:08,495 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:08,495 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:08,495 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:08,495 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-26 22:33:08,496 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:08,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:33:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:08,555 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:08,672 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:08,673 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 82 [2020-10-26 22:33:08,673 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:08,673 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 130 [2020-10-26 22:33:08,673 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:08,673 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:08,674 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:08,674 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-26 22:33:08,674 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:08,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [36382398] [2020-10-26 22:33:08,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:08,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:08,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852572375] [2020-10-26 22:33:08,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:08,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:08,768 INFO L87 Difference]: Start difference. First operand 748 states and 910 transitions. Second operand 7 states. [2020-10-26 22:33:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:10,547 INFO L93 Difference]: Finished difference Result 1665 states and 2142 transitions. [2020-10-26 22:33:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:33:10,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 178 [2020-10-26 22:33:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:10,554 INFO L225 Difference]: With dead ends: 1665 [2020-10-26 22:33:10,555 INFO L226 Difference]: Without dead ends: 1066 [2020-10-26 22:33:10,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 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:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2020-10-26 22:33:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 903. [2020-10-26 22:33:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2020-10-26 22:33:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1107 transitions. [2020-10-26 22:33:10,596 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1107 transitions. Word has length 178 [2020-10-26 22:33:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:10,596 INFO L481 AbstractCegarLoop]: Abstraction has 903 states and 1107 transitions. [2020-10-26 22:33:10,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1107 transitions. [2020-10-26 22:33:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-10-26 22:33:10,600 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:10,600 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:10,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 22:33:10,600 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:10,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:10,601 INFO L82 PathProgramCache]: Analyzing trace with hash 899222318, now seen corresponding path program 1 times [2020-10-26 22:33:10,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:10,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [148608858] [2020-10-26 22:33:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:10,671 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:10,816 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:10,920 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:11,682 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:11,683 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 201 [2020-10-26 22:33:11,683 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:33:11,683 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1038 [2020-10-26 22:33:11,683 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:11,683 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:11,684 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-26 22:33:11,684 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 84 [2020-10-26 22:33:11,684 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:11,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:11,773 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:11,777 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:11,778 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:11,778 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:11,778 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:33:11,778 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:11,778 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:11,779 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:11,779 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:11,779 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:11,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:11,816 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:11,872 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:11,873 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-26 22:33:11,873 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:11,873 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 65 [2020-10-26 22:33:11,873 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:11,873 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:11,874 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:11,874 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-26 22:33:11,874 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:11,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-26 22:33:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:11,927 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:12,060 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:12,061 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 82 [2020-10-26 22:33:12,061 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:12,061 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 144 [2020-10-26 22:33:12,061 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:12,062 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:12,062 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:12,062 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-26 22:33:12,062 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:12,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [148608858] [2020-10-26 22:33:12,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:12,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:12,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108519205] [2020-10-26 22:33:12,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:12,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:12,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:12,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:12,245 INFO L87 Difference]: Start difference. First operand 903 states and 1107 transitions. Second operand 7 states. [2020-10-26 22:33:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:13,958 INFO L93 Difference]: Finished difference Result 2120 states and 2703 transitions. [2020-10-26 22:33:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 22:33:13,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2020-10-26 22:33:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:13,967 INFO L225 Difference]: With dead ends: 2120 [2020-10-26 22:33:13,967 INFO L226 Difference]: Without dead ends: 1072 [2020-10-26 22:33:13,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:33:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2020-10-26 22:33:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1050. [2020-10-26 22:33:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2020-10-26 22:33:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1237 transitions. [2020-10-26 22:33:14,013 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1237 transitions. Word has length 187 [2020-10-26 22:33:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:14,014 INFO L481 AbstractCegarLoop]: Abstraction has 1050 states and 1237 transitions. [2020-10-26 22:33:14,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1237 transitions. [2020-10-26 22:33:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-10-26 22:33:14,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:14,018 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 22:33:14,018 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:14,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1267295384, now seen corresponding path program 1 times [2020-10-26 22:33:14,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:14,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2041723467] [2020-10-26 22:33:14,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:14,103 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:14,420 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:14,507 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:14,507 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 223 [2020-10-26 22:33:14,508 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:14,508 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 437 [2020-10-26 22:33:14,508 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:14,508 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:14,508 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 194 [2020-10-26 22:33:14,508 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-10-26 22:33:14,509 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:14,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:14,654 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:14,659 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:14,659 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:14,660 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:14,660 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:33:14,660 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:14,660 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:14,660 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:14,661 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:14,661 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:14,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:14,680 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:14,698 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:14,698 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:33:14,698 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:14,698 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 19 [2020-10-26 22:33:14,699 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:14,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:14,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:14,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:14,699 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:14,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-26 22:33:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:14,760 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:14,846 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:14,846 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-10-26 22:33:14,847 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:14,847 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 104 [2020-10-26 22:33:14,847 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:14,847 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:14,847 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:14,847 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 107 [2020-10-26 22:33:14,848 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-10-26 22:33:14,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2041723467] [2020-10-26 22:33:14,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:14,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:33:14,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323422190] [2020-10-26 22:33:14,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:33:14,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:33:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:33:14,965 INFO L87 Difference]: Start difference. First operand 1050 states and 1237 transitions. Second operand 5 states. [2020-10-26 22:33:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:16,034 INFO L93 Difference]: Finished difference Result 1219 states and 1409 transitions. [2020-10-26 22:33:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:33:16,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2020-10-26 22:33:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:16,041 INFO L225 Difference]: With dead ends: 1219 [2020-10-26 22:33:16,041 INFO L226 Difference]: Without dead ends: 1054 [2020-10-26 22:33:16,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:33:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2020-10-26 22:33:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1048. [2020-10-26 22:33:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2020-10-26 22:33:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1230 transitions. [2020-10-26 22:33:16,078 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1230 transitions. Word has length 209 [2020-10-26 22:33:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:16,079 INFO L481 AbstractCegarLoop]: Abstraction has 1048 states and 1230 transitions. [2020-10-26 22:33:16,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:33:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1230 transitions. [2020-10-26 22:33:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2020-10-26 22:33:16,083 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:16,083 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-26 22:33:16,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 22:33:16,084 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1780624794, now seen corresponding path program 1 times [2020-10-26 22:33:16,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:16,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [420925572] [2020-10-26 22:33:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:16,176 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:16,250 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:17,654 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:17,655 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 237 [2020-10-26 22:33:17,655 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:33:17,655 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1515 [2020-10-26 22:33:17,655 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:17,656 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:17,656 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:33:17,656 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 84 [2020-10-26 22:33:17,656 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:17,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:17,764 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:17,769 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:17,769 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:17,770 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:17,770 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-26 22:33:17,770 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:17,770 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:17,771 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:17,771 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:17,771 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:17,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:17,836 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:17,944 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:17,945 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:33:17,945 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:17,945 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 129 [2020-10-26 22:33:17,945 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:17,946 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:17,946 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:17,946 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:33:17,946 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:17,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:33:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:18,034 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:18,149 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:18,149 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 82 [2020-10-26 22:33:18,149 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:18,149 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 129 [2020-10-26 22:33:18,150 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:18,150 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:18,150 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:18,150 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-26 22:33:18,150 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:18,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [420925572] [2020-10-26 22:33:18,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:18,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:18,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302014603] [2020-10-26 22:33:18,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:18,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:18,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:18,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:18,268 INFO L87 Difference]: Start difference. First operand 1048 states and 1230 transitions. Second operand 7 states. [2020-10-26 22:33:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:20,064 INFO L93 Difference]: Finished difference Result 2561 states and 3121 transitions. [2020-10-26 22:33:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 22:33:20,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2020-10-26 22:33:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:20,079 INFO L225 Difference]: With dead ends: 2561 [2020-10-26 22:33:20,079 INFO L226 Difference]: Without dead ends: 1662 [2020-10-26 22:33:20,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:33:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2020-10-26 22:33:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1650. [2020-10-26 22:33:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2020-10-26 22:33:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 1948 transitions. [2020-10-26 22:33:20,136 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 1948 transitions. Word has length 223 [2020-10-26 22:33:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:20,137 INFO L481 AbstractCegarLoop]: Abstraction has 1650 states and 1948 transitions. [2020-10-26 22:33:20,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1948 transitions. [2020-10-26 22:33:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-10-26 22:33:20,142 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:20,143 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-26 22:33:20,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 22:33:20,143 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:20,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash 386945402, now seen corresponding path program 1 times [2020-10-26 22:33:20,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:20,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1257358366] [2020-10-26 22:33:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:20,234 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:20,597 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:20,598 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 259 [2020-10-26 22:33:20,598 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:20,598 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 397 [2020-10-26 22:33:20,598 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:20,598 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:20,598 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 230 [2020-10-26 22:33:20,599 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-26 22:33:20,599 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:20,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:20,688 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:20,693 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:20,693 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:20,693 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:20,693 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:33:20,694 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:20,694 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:20,694 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:20,694 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:20,694 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:20,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:20,716 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:20,752 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:20,752 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 138 [2020-10-26 22:33:20,752 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:20,752 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 37 [2020-10-26 22:33:20,752 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:20,753 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:20,753 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:20,753 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:20,753 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:20,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-10-26 22:33:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:20,828 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:20,887 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:20,888 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 82 [2020-10-26 22:33:20,888 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:20,888 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 68 [2020-10-26 22:33:20,888 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:20,888 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:20,888 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:20,889 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-26 22:33:20,889 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-26 22:33:20,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1257358366] [2020-10-26 22:33:20,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:20,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-26 22:33:20,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900308679] [2020-10-26 22:33:20,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 22:33:20,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 22:33:20,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:33:20,993 INFO L87 Difference]: Start difference. First operand 1650 states and 1948 transitions. Second operand 5 states. [2020-10-26 22:33:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:22,463 INFO L93 Difference]: Finished difference Result 3443 states and 4144 transitions. [2020-10-26 22:33:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:33:22,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2020-10-26 22:33:22,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:22,481 INFO L225 Difference]: With dead ends: 3443 [2020-10-26 22:33:22,481 INFO L226 Difference]: Without dead ends: 1942 [2020-10-26 22:33:22,486 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:33:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2020-10-26 22:33:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1938. [2020-10-26 22:33:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2020-10-26 22:33:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2241 transitions. [2020-10-26 22:33:22,550 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2241 transitions. Word has length 245 [2020-10-26 22:33:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:22,550 INFO L481 AbstractCegarLoop]: Abstraction has 1938 states and 2241 transitions. [2020-10-26 22:33:22,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 22:33:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2241 transitions. [2020-10-26 22:33:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2020-10-26 22:33:22,556 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:22,557 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-26 22:33:22,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 22:33:22,557 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2071165358, now seen corresponding path program 1 times [2020-10-26 22:33:22,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:22,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [249040739] [2020-10-26 22:33:22,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:22,689 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:23,182 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:23,183 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 273 [2020-10-26 22:33:23,183 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:23,183 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 543 [2020-10-26 22:33:23,183 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:23,184 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:23,184 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-26 22:33:23,184 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-26 22:33:23,184 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:23,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:33:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:23,307 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:23,312 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:23,312 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:33:23,312 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:23,312 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:33:23,313 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:23,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:33:23,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:23,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:33:23,313 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:23,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:33:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:23,390 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:23,516 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:23,516 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-26 22:33:23,517 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:23,517 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 150 [2020-10-26 22:33:23,517 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:23,518 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:33:23,518 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:33:23,518 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-26 22:33:23,519 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:33:23,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-26 22:33:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:33:23,649 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:33:23,828 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:33:23,828 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-26 22:33:23,828 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:33:23,828 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 203 [2020-10-26 22:33:23,829 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:33:23,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:33:23,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:33:23,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-26 22:33:23,829 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:33:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:33:24,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [249040739] [2020-10-26 22:33:24,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:33:24,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:33:24,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529878280] [2020-10-26 22:33:24,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:33:24,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:33:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:33:24,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:33:24,054 INFO L87 Difference]: Start difference. First operand 1938 states and 2241 transitions. Second operand 7 states. [2020-10-26 22:33:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:33:25,807 INFO L93 Difference]: Finished difference Result 4023 states and 4670 transitions. [2020-10-26 22:33:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 22:33:25,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 259 [2020-10-26 22:33:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:33:25,823 INFO L225 Difference]: With dead ends: 4023 [2020-10-26 22:33:25,823 INFO L226 Difference]: Without dead ends: 2234 [2020-10-26 22:33:25,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-26 22:33:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2020-10-26 22:33:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2228. [2020-10-26 22:33:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2020-10-26 22:33:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2543 transitions. [2020-10-26 22:33:25,908 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2543 transitions. Word has length 259 [2020-10-26 22:33:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:33:25,909 INFO L481 AbstractCegarLoop]: Abstraction has 2228 states and 2543 transitions. [2020-10-26 22:33:25,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:33:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2543 transitions. [2020-10-26 22:33:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2020-10-26 22:33:25,917 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:33:25,917 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:33:25,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 22:33:25,918 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:33:25,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:33:25,918 INFO L82 PathProgramCache]: Analyzing trace with hash 817013972, now seen corresponding path program 1 times [2020-10-26 22:33:25,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:33:25,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1401488616] [2020-10-26 22:33:25,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:33:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 22:33:25,986 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-26 22:33:25,986 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 22:33:25,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 22:33:26,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:33:26 BoogieIcfgContainer [2020-10-26 22:33:26,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 22:33:26,075 INFO L168 Benchmark]: Toolchain (without parser) took 33261.46 ms. Allocated memory was 155.2 MB in the beginning and 588.3 MB in the end (delta: 433.1 MB). Free memory was 134.8 MB in the beginning and 306.8 MB in the end (delta: -172.0 MB). Peak memory consumption was 260.8 MB. Max. memory is 8.0 GB. [2020-10-26 22:33:26,075 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 155.2 MB. Free memory was 127.4 MB in the beginning and 127.3 MB in the end (delta: 134.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-26 22:33:26,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.20 ms. Allocated memory is still 155.2 MB. Free memory was 134.2 MB in the beginning and 128.5 MB in the end (delta: 5.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 8.0 GB. [2020-10-26 22:33:26,078 INFO L168 Benchmark]: Boogie Preprocessor took 137.29 ms. Allocated memory is still 155.2 MB. Free memory was 128.5 MB in the beginning and 123.7 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:33:26,081 INFO L168 Benchmark]: RCFGBuilder took 1521.19 ms. Allocated memory is still 155.2 MB. Free memory was 123.7 MB in the beginning and 79.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 50.0 MB. Max. memory is 8.0 GB. [2020-10-26 22:33:26,082 INFO L168 Benchmark]: TraceAbstraction took 30846.56 ms. Allocated memory was 155.2 MB in the beginning and 588.3 MB in the end (delta: 433.1 MB). Free memory was 78.5 MB in the beginning and 306.8 MB in the end (delta: -228.3 MB). Peak memory consumption was 204.8 MB. Max. memory is 8.0 GB. [2020-10-26 22:33:26,090 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.70 ms. Allocated memory is still 155.2 MB. Free memory was 127.4 MB in the beginning and 127.3 MB in the end (delta: 134.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 743.20 ms. Allocated memory is still 155.2 MB. Free memory was 134.2 MB in the beginning and 128.5 MB in the end (delta: 5.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 137.29 ms. Allocated memory is still 155.2 MB. Free memory was 128.5 MB in the beginning and 123.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1521.19 ms. Allocated memory is still 155.2 MB. Free memory was 123.7 MB in the beginning and 79.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 50.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 30846.56 ms. Allocated memory was 155.2 MB in the beginning and 588.3 MB in the end (delta: 433.1 MB). Free memory was 78.5 MB in the beginning and 306.8 MB in the end (delta: -228.3 MB). Peak memory consumption was 204.8 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 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 TRUE ((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14))) [L439] a1 = (((((a1 / 5) % 89)- -128) / 5) + 34) [L440] a10 = 0 [L441] a19 = 8 [L443] return -1; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND 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 TRUE (((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) [L66] CALL reach_error() [L4] __assert_fail("0", "Problem10_label41.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: 30.7s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 278 SDtfs, 3214 SDslu, 302 SDs, 0 SdLazy, 8865 SolverSat, 1104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2228occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 245 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 1919 NumberOfCodeBlocks, 1919 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1631 ConstructedInterpolants, 0 QuantifiedInterpolants, 969643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 767/781 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...