/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.4 --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 -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label41.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-14 02:31:20,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-14 02:31:20,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-14 02:31:20,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-14 02:31:20,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-14 02:31:20,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-14 02:31:20,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-14 02:31:20,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-14 02:31:20,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-14 02:31:20,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-14 02:31:20,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-14 02:31:20,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-14 02:31:20,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-14 02:31:20,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-14 02:31:20,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-14 02:31:20,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-14 02:31:20,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-14 02:31:20,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-14 02:31:20,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-14 02:31:20,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-14 02:31:20,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-14 02:31:20,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-14 02:31:20,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-14 02:31:20,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-14 02:31:20,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-14 02:31:20,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-14 02:31:20,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-14 02:31:20,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-14 02:31:20,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-14 02:31:20,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-14 02:31:20,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-14 02:31:20,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-14 02:31:20,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-14 02:31:20,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-14 02:31:20,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-14 02:31:20,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-14 02:31:20,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-14 02:31:20,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-14 02:31:20,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-14 02:31:20,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-14 02:31:20,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-14 02:31:20,174 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-14 02:31:20,215 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-14 02:31:20,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-14 02:31:20,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-14 02:31:20,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-14 02:31:20,217 INFO L138 SettingsManager]: * Use SBE=true [2020-10-14 02:31:20,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-14 02:31:20,218 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-14 02:31:20,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-14 02:31:20,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-14 02:31:20,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-14 02:31:20,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-14 02:31:20,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-14 02:31:20,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-14 02:31:20,219 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-14 02:31:20,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-14 02:31:20,219 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-14 02:31:20,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-14 02:31:20,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-14 02:31:20,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-14 02:31:20,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-14 02:31:20,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-14 02:31:20,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-14 02:31:20,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-14 02:31:20,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-14 02:31:20,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-14 02:31:20,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-14 02:31:20,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-14 02:31:20,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-14 02:31:20,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-14 02:31:20,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=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=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=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=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=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=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=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=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=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=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=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=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=true; [2020-10-14 02:31:20,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-14 02:31:20,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-14 02:31:20,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-14 02:31:20,522 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-14 02:31:20,522 INFO L275 PluginConnector]: CDTParser initialized [2020-10-14 02:31:20,523 INFO L429 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-14 02:31:20,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ffd9946a2/2a65e7b8cc7f4e47959f8e4ef596df28/FLAG28a98bb91 [2020-10-14 02:31:21,133 INFO L306 CDTParser]: Found 1 translation units. [2020-10-14 02:31:21,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label41.c [2020-10-14 02:31:21,147 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ffd9946a2/2a65e7b8cc7f4e47959f8e4ef596df28/FLAG28a98bb91 [2020-10-14 02:31:21,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ffd9946a2/2a65e7b8cc7f4e47959f8e4ef596df28 [2020-10-14 02:31:21,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-14 02:31:21,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-14 02:31:21,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-14 02:31:21,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-14 02:31:21,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-14 02:31:21,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:31:21" (1/1) ... [2020-10-14 02:31:21,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af20ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:21, skipping insertion in model container [2020-10-14 02:31:21,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:31:21" (1/1) ... [2020-10-14 02:31:21,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-14 02:31:21,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-14 02:31:21,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 02:31:22,002 INFO L203 MainTranslator]: Completed pre-run [2020-10-14 02:31:22,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 02:31:22,219 INFO L208 MainTranslator]: Completed translation [2020-10-14 02:31:22,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:22 WrapperNode [2020-10-14 02:31:22,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-14 02:31:22,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-14 02:31:22,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-14 02:31:22,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-14 02:31:22,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:22" (1/1) ... [2020-10-14 02:31:22,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:22" (1/1) ... [2020-10-14 02:31:22,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:22" (1/1) ... [2020-10-14 02:31:22,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:22" (1/1) ... [2020-10-14 02:31:22,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:22" (1/1) ... [2020-10-14 02:31:22,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:22" (1/1) ... [2020-10-14 02:31:22,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:22" (1/1) ... [2020-10-14 02:31:22,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-14 02:31:22,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-14 02:31:22,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-14 02:31:22,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-14 02:31:22,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:22" (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-14 02:31:22,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-14 02:31:22,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-14 02:31:22,432 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-14 02:31:22,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-14 02:31:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-14 02:31:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-14 02:31:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-14 02:31:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-14 02:31:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-14 02:31:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-14 02:31:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-14 02:31:23,597 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-14 02:31:23,597 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-14 02:31:23,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:31:23 BoogieIcfgContainer [2020-10-14 02:31:23,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-14 02:31:23,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-14 02:31:23,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-14 02:31:23,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-14 02:31:23,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:31:21" (1/3) ... [2020-10-14 02:31:23,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b37ea35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:31:23, skipping insertion in model container [2020-10-14 02:31:23,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:22" (2/3) ... [2020-10-14 02:31:23,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b37ea35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:31:23, skipping insertion in model container [2020-10-14 02:31:23,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:31:23" (3/3) ... [2020-10-14 02:31:23,618 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label41.c [2020-10-14 02:31:23,628 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-14 02:31:23,638 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-14 02:31:23,651 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-14 02:31:23,682 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-14 02:31:23,683 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-14 02:31:23,683 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-14 02:31:23,683 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-14 02:31:23,683 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-14 02:31:23,683 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-14 02:31:23,683 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-14 02:31:23,684 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-14 02:31:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-14 02:31:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-14 02:31:23,709 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:23,710 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] [2020-10-14 02:31:23,711 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash -354743369, now seen corresponding path program 1 times [2020-10-14 02:31:23,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:23,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512934454] [2020-10-14 02:31:23,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:23,879 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:24,135 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:24,136 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 34 [2020-10-14 02:31:24,136 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:24,136 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 287 [2020-10-14 02:31:24,139 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:24,140 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:24,140 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 02:31:24,141 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 02:31:24,141 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 28 [2020-10-14 02:31:24,141 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-10-14 02:31:24,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:24,268 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:24,275 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:24,276 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:24,276 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:24,276 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-10-14 02:31:24,276 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:24,277 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:24,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:24,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:24,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 02:31:24,278 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:24,295 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-14 02:31:24,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512934454] [2020-10-14 02:31:24,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 02:31:24,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-14 02:31:24,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939126868] [2020-10-14 02:31:24,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-14 02:31:24,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-14 02:31:24,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-14 02:31:24,326 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-10-14 02:31:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:25,672 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2020-10-14 02:31:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:31:25,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-14 02:31:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:25,704 INFO L225 Difference]: With dead ends: 581 [2020-10-14 02:31:25,704 INFO L226 Difference]: Without dead ends: 302 [2020-10-14 02:31:25,715 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:31:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-14 02:31:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2020-10-14 02:31:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-14 02:31:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2020-10-14 02:31:25,830 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 26 [2020-10-14 02:31:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:25,830 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2020-10-14 02:31:25,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-14 02:31:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2020-10-14 02:31:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-14 02:31:25,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:25,835 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] [2020-10-14 02:31:25,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-14 02:31:25,836 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1197426710, now seen corresponding path program 1 times [2020-10-14 02:31:25,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:25,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1211370869] [2020-10-14 02:31:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:25,890 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:26,032 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:26,417 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:26,501 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:26,501 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 108 [2020-10-14 02:31:26,502 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 02:31:26,502 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 630 [2020-10-14 02:31:26,503 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:26,503 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:26,504 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:26,504 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 82 [2020-10-14 02:31:26,504 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-14 02:31:26,504 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:26,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:26,563 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:26,565 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:26,566 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:26,566 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:26,566 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 02:31:26,567 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:26,567 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:26,567 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:26,567 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:26,568 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:26,568 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:26,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:26,601 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:26,643 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:26,643 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-14 02:31:26,643 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:26,643 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 50 [2020-10-14 02:31:26,644 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:26,644 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:26,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:26,644 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:26,645 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-10-14 02:31:26,645 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:26,686 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-14 02:31:26,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1211370869] [2020-10-14 02:31:26,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:26,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-14 02:31:26,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72252064] [2020-10-14 02:31:26,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-14 02:31:26,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:26,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-14 02:31:26,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-14 02:31:26,690 INFO L87 Difference]: Start difference. First operand 296 states and 423 transitions. Second operand 6 states. [2020-10-14 02:31:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:30,147 INFO L93 Difference]: Finished difference Result 886 states and 1297 transitions. [2020-10-14 02:31:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:31:30,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2020-10-14 02:31:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:30,159 INFO L225 Difference]: With dead ends: 886 [2020-10-14 02:31:30,159 INFO L226 Difference]: Without dead ends: 596 [2020-10-14 02:31:30,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-10-14 02:31:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 586. [2020-10-14 02:31:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2020-10-14 02:31:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 834 transitions. [2020-10-14 02:31:30,203 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 834 transitions. Word has length 98 [2020-10-14 02:31:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:30,204 INFO L479 AbstractCegarLoop]: Abstraction has 586 states and 834 transitions. [2020-10-14 02:31:30,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-14 02:31:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 834 transitions. [2020-10-14 02:31:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-10-14 02:31:30,207 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:30,207 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] [2020-10-14 02:31:30,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-14 02:31:30,207 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:30,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:30,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2022675503, now seen corresponding path program 1 times [2020-10-14 02:31:30,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:30,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1270567819] [2020-10-14 02:31:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:30,265 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:30,444 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:30,739 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:30,740 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 117 [2020-10-14 02:31:30,740 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 02:31:30,740 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 495 [2020-10-14 02:31:30,740 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:30,741 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:30,741 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:30,741 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 91 [2020-10-14 02:31:30,741 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-14 02:31:30,741 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:30,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:30,797 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:30,799 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:30,799 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:30,799 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:30,799 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:31:30,800 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:30,800 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:30,800 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:30,800 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:30,801 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:30,801 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:30,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:30,866 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:30,914 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:30,915 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 82 [2020-10-14 02:31:30,915 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:30,915 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 85 [2020-10-14 02:31:30,916 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:30,916 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:30,916 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:30,916 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:30,917 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-14 02:31:30,917 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:30,952 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-14 02:31:30,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1270567819] [2020-10-14 02:31:30,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:30,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 02:31:30,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639245649] [2020-10-14 02:31:30,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:31:30,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:30,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:31:30,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:31:30,955 INFO L87 Difference]: Start difference. First operand 586 states and 834 transitions. Second operand 5 states. [2020-10-14 02:31:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:32,203 INFO L93 Difference]: Finished difference Result 1466 states and 2147 transitions. [2020-10-14 02:31:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:31:32,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2020-10-14 02:31:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:32,212 INFO L225 Difference]: With dead ends: 1466 [2020-10-14 02:31:32,212 INFO L226 Difference]: Without dead ends: 886 [2020-10-14 02:31:32,216 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-14 02:31:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2020-10-14 02:31:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 878. [2020-10-14 02:31:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-10-14 02:31:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1192 transitions. [2020-10-14 02:31:32,248 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1192 transitions. Word has length 107 [2020-10-14 02:31:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:32,249 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1192 transitions. [2020-10-14 02:31:32,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:31:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1192 transitions. [2020-10-14 02:31:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-10-14 02:31:32,253 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:32,253 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, 1, 1, 1, 1, 1, 1, 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-14 02:31:32,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-14 02:31:32,254 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:32,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash 287111494, now seen corresponding path program 1 times [2020-10-14 02:31:32,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:32,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1467145410] [2020-10-14 02:31:32,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:32,312 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:32,499 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:32,615 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:33,233 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:33,234 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 148 [2020-10-14 02:31:33,234 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 02:31:33,234 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 943 [2020-10-14 02:31:33,234 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:33,234 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:33,235 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:33,235 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 122 [2020-10-14 02:31:33,235 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-10-14 02:31:33,235 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:33,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:33,309 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:33,311 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:33,312 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:33,312 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:33,312 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 02:31:33,313 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:33,313 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:33,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:33,313 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:33,314 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:33,314 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:33,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:33,362 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:33,461 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:33,462 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-10-14 02:31:33,462 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:33,462 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 113 [2020-10-14 02:31:33,462 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:33,463 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:33,463 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:33,465 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:33,465 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 107 [2020-10-14 02:31:33,465 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 02:31:33,545 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-14 02:31:33,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1467145410] [2020-10-14 02:31:33,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:33,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 02:31:33,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874851059] [2020-10-14 02:31:33,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:31:33,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:31:33,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:31:33,548 INFO L87 Difference]: Start difference. First operand 878 states and 1192 transitions. Second operand 5 states. [2020-10-14 02:31:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:34,968 INFO L93 Difference]: Finished difference Result 2483 states and 3486 transitions. [2020-10-14 02:31:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:31:34,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2020-10-14 02:31:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:34,983 INFO L225 Difference]: With dead ends: 2483 [2020-10-14 02:31:34,983 INFO L226 Difference]: Without dead ends: 1611 [2020-10-14 02:31:34,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-14 02:31:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2020-10-14 02:31:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1460. [2020-10-14 02:31:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2020-10-14 02:31:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1920 transitions. [2020-10-14 02:31:35,051 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1920 transitions. Word has length 138 [2020-10-14 02:31:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:35,051 INFO L479 AbstractCegarLoop]: Abstraction has 1460 states and 1920 transitions. [2020-10-14 02:31:35,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:31:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1920 transitions. [2020-10-14 02:31:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-10-14 02:31:35,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:35,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 02:31:35,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-14 02:31:35,055 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:35,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129801, now seen corresponding path program 1 times [2020-10-14 02:31:35,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:35,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [690179910] [2020-10-14 02:31:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:35,110 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:35,478 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:35,478 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 153 [2020-10-14 02:31:35,478 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:35,479 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 388 [2020-10-14 02:31:35,479 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:35,479 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:35,479 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 02:31:35,480 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 02:31:35,480 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 123 [2020-10-14 02:31:35,480 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:35,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:35,535 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:35,538 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:35,539 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:35,539 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:35,539 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-14 02:31:35,539 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:35,540 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:35,540 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:35,540 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:35,540 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 02:31:35,540 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:35,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:35,589 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:35,742 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:35,742 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-14 02:31:35,742 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:35,743 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 167 [2020-10-14 02:31:35,743 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:35,743 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:35,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:35,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:35,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-14 02:31:35,744 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:35,848 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-14 02:31:35,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [690179910] [2020-10-14 02:31:35,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 02:31:35,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-14 02:31:35,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887957792] [2020-10-14 02:31:35,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:35,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:35,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:35,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:35,859 INFO L87 Difference]: Start difference. First operand 1460 states and 1920 transitions. Second operand 7 states. [2020-10-14 02:31:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:37,364 INFO L93 Difference]: Finished difference Result 3075 states and 4100 transitions. [2020-10-14 02:31:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-14 02:31:37,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2020-10-14 02:31:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:37,374 INFO L225 Difference]: With dead ends: 3075 [2020-10-14 02:31:37,374 INFO L226 Difference]: Without dead ends: 1621 [2020-10-14 02:31:37,377 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-14 02:31:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2020-10-14 02:31:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1476. [2020-10-14 02:31:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2020-10-14 02:31:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1965 transitions. [2020-10-14 02:31:37,423 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1965 transitions. Word has length 143 [2020-10-14 02:31:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:37,423 INFO L479 AbstractCegarLoop]: Abstraction has 1476 states and 1965 transitions. [2020-10-14 02:31:37,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1965 transitions. [2020-10-14 02:31:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-10-14 02:31:37,428 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:37,429 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, 1, 1, 1, 1] [2020-10-14 02:31:37,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-14 02:31:37,429 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:37,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1399381286, now seen corresponding path program 1 times [2020-10-14 02:31:37,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:37,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [717966946] [2020-10-14 02:31:37,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:37,509 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:37,839 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:37,840 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 225 [2020-10-14 02:31:37,840 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:37,840 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 363 [2020-10-14 02:31:37,840 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:37,840 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:37,841 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:37,841 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-14 02:31:37,841 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-14 02:31:37,841 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:37,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:37,898 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:37,900 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:37,900 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:37,900 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:37,900 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:31:37,901 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:37,901 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:37,901 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:37,902 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:37,902 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:37,902 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:37,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:37,929 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:37,963 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:37,963 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 02:31:37,963 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:37,964 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 39 [2020-10-14 02:31:37,964 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:37,964 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:37,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:37,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:37,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-14 02:31:37,965 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:37,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-14 02:31:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:38,017 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:38,182 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:38,182 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-14 02:31:38,182 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:38,183 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 178 [2020-10-14 02:31:38,183 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:38,183 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:38,183 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:38,184 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:38,184 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-14 02:31:38,184 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:38,395 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-14 02:31:38,396 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [717966946] [2020-10-14 02:31:38,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:38,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:31:38,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273450044] [2020-10-14 02:31:38,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:38,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:38,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:38,399 INFO L87 Difference]: Start difference. First operand 1476 states and 1965 transitions. Second operand 7 states. [2020-10-14 02:31:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:39,926 INFO L93 Difference]: Finished difference Result 3475 states and 5014 transitions. [2020-10-14 02:31:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-14 02:31:39,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 213 [2020-10-14 02:31:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:39,941 INFO L225 Difference]: With dead ends: 3475 [2020-10-14 02:31:39,941 INFO L226 Difference]: Without dead ends: 2148 [2020-10-14 02:31:39,945 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-14 02:31:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2020-10-14 02:31:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1786. [2020-10-14 02:31:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2020-10-14 02:31:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2324 transitions. [2020-10-14 02:31:40,013 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2324 transitions. Word has length 213 [2020-10-14 02:31:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:40,014 INFO L479 AbstractCegarLoop]: Abstraction has 1786 states and 2324 transitions. [2020-10-14 02:31:40,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2324 transitions. [2020-10-14 02:31:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-10-14 02:31:40,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:40,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 02:31:40,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-14 02:31:40,020 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:40,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:40,020 INFO L82 PathProgramCache]: Analyzing trace with hash -942829970, now seen corresponding path program 1 times [2020-10-14 02:31:40,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:40,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945337619] [2020-10-14 02:31:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:40,070 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:40,559 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:40,560 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 229 [2020-10-14 02:31:40,560 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:40,560 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 510 [2020-10-14 02:31:40,561 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:40,561 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:40,561 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 02:31:40,564 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 02:31:40,565 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-14 02:31:40,565 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-10-14 02:31:40,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:40,614 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:40,620 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:40,620 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:40,621 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:40,621 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-14 02:31:40,621 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:40,621 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:40,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:40,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:40,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 02:31:40,623 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:40,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:40,666 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:40,783 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:40,783 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-10-14 02:31:40,784 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:40,785 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 126 [2020-10-14 02:31:40,785 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:40,785 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:40,786 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:40,786 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:40,786 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-10-14 02:31:40,787 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:40,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-10-14 02:31:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:40,870 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:40,916 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:40,917 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-14 02:31:40,917 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:40,917 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 60 [2020-10-14 02:31:40,917 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:40,917 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:40,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:40,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 115 [2020-10-14 02:31:40,918 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:40,918 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 38 proven. 69 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-14 02:31:41,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [945337619] [2020-10-14 02:31:41,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:41,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:31:41,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863176056] [2020-10-14 02:31:41,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:41,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:41,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:41,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:41,048 INFO L87 Difference]: Start difference. First operand 1786 states and 2324 transitions. Second operand 7 states. [2020-10-14 02:31:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:42,385 INFO L93 Difference]: Finished difference Result 3739 states and 4958 transitions. [2020-10-14 02:31:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 02:31:42,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 217 [2020-10-14 02:31:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:42,396 INFO L225 Difference]: With dead ends: 3739 [2020-10-14 02:31:42,397 INFO L226 Difference]: Without dead ends: 2102 [2020-10-14 02:31:42,401 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-14 02:31:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2020-10-14 02:31:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2084. [2020-10-14 02:31:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2020-10-14 02:31:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2465 transitions. [2020-10-14 02:31:42,453 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2465 transitions. Word has length 217 [2020-10-14 02:31:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:42,454 INFO L479 AbstractCegarLoop]: Abstraction has 2084 states and 2465 transitions. [2020-10-14 02:31:42,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2465 transitions. [2020-10-14 02:31:42,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-10-14 02:31:42,458 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:42,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 02:31:42,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-14 02:31:42,459 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1782157579, now seen corresponding path program 1 times [2020-10-14 02:31:42,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:42,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1590071819] [2020-10-14 02:31:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:42,517 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:42,669 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:42,895 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:42,895 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 234 [2020-10-14 02:31:42,896 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 02:31:42,896 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 401 [2020-10-14 02:31:42,896 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:42,896 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:42,897 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:42,898 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 02:31:42,898 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-14 02:31:42,898 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 02:31:42,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:42,952 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:42,954 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:42,954 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:42,955 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:42,955 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:31:42,955 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:42,955 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:42,955 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:42,955 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:42,956 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:42,956 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:42,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:42,988 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:43,028 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:43,030 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 02:31:43,030 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:43,030 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 49 [2020-10-14 02:31:43,030 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:43,031 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:43,031 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:43,031 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:43,031 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 02:31:43,031 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:43,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-14 02:31:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:43,090 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:43,283 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:43,283 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-14 02:31:43,284 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:43,284 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 212 [2020-10-14 02:31:43,284 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:43,284 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:43,284 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:43,285 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:43,285 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-14 02:31:43,285 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:43,474 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-14 02:31:43,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1590071819] [2020-10-14 02:31:43,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:43,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:31:43,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036333039] [2020-10-14 02:31:43,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:43,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:43,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:43,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:43,477 INFO L87 Difference]: Start difference. First operand 2084 states and 2465 transitions. Second operand 7 states. [2020-10-14 02:31:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:45,849 INFO L93 Difference]: Finished difference Result 5036 states and 6049 transitions. [2020-10-14 02:31:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 02:31:45,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2020-10-14 02:31:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:45,862 INFO L225 Difference]: With dead ends: 5036 [2020-10-14 02:31:45,863 INFO L226 Difference]: Without dead ends: 2370 [2020-10-14 02:31:45,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-14 02:31:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2020-10-14 02:31:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2082. [2020-10-14 02:31:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2020-10-14 02:31:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2406 transitions. [2020-10-14 02:31:45,914 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2406 transitions. Word has length 222 [2020-10-14 02:31:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:45,914 INFO L479 AbstractCegarLoop]: Abstraction has 2082 states and 2406 transitions. [2020-10-14 02:31:45,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2406 transitions. [2020-10-14 02:31:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2020-10-14 02:31:45,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:45,920 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] [2020-10-14 02:31:45,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-14 02:31:45,920 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:45,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1063407853, now seen corresponding path program 1 times [2020-10-14 02:31:45,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:45,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580381486] [2020-10-14 02:31:45,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:46,042 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:46,380 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:46,381 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 270 [2020-10-14 02:31:46,381 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:46,381 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 405 [2020-10-14 02:31:46,381 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:46,382 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:46,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:46,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-14 02:31:46,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-14 02:31:46,382 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:46,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:46,462 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:46,464 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:46,465 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:46,465 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:46,465 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:31:46,465 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:46,466 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:46,466 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:46,466 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:46,466 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:46,466 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:46,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:46,516 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:46,596 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:46,597 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-14 02:31:46,597 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:46,597 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 95 [2020-10-14 02:31:46,597 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:46,597 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:46,598 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:46,598 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:46,598 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-14 02:31:46,598 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:46,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-14 02:31:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:46,675 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:46,869 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:46,870 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-10-14 02:31:46,870 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:46,870 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 209 [2020-10-14 02:31:46,870 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:46,871 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:46,871 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:46,871 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:46,871 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-10-14 02:31:46,871 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:47,110 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-14 02:31:47,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580381486] [2020-10-14 02:31:47,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:47,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:31:47,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869805982] [2020-10-14 02:31:47,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:47,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:47,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:47,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:47,113 INFO L87 Difference]: Start difference. First operand 2082 states and 2406 transitions. Second operand 7 states. [2020-10-14 02:31:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:48,668 INFO L93 Difference]: Finished difference Result 4319 states and 5009 transitions. [2020-10-14 02:31:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 02:31:48,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 258 [2020-10-14 02:31:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:48,683 INFO L225 Difference]: With dead ends: 4319 [2020-10-14 02:31:48,683 INFO L226 Difference]: Without dead ends: 2386 [2020-10-14 02:31:48,687 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-14 02:31:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-10-14 02:31:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2374. [2020-10-14 02:31:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2020-10-14 02:31:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 2707 transitions. [2020-10-14 02:31:48,736 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 2707 transitions. Word has length 258 [2020-10-14 02:31:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:48,737 INFO L479 AbstractCegarLoop]: Abstraction has 2374 states and 2707 transitions. [2020-10-14 02:31:48,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 2707 transitions. [2020-10-14 02:31:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2020-10-14 02:31:48,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:48,743 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] [2020-10-14 02:31:48,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-14 02:31:48,744 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:48,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:48,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1472655782, now seen corresponding path program 1 times [2020-10-14 02:31:48,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:48,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1862261786] [2020-10-14 02:31:48,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-14 02:31:48,802 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-14 02:31:48,803 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-14 02:31:48,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-14 02:31:48,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:31:48 BoogieIcfgContainer [2020-10-14 02:31:48,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-14 02:31:48,880 INFO L168 Benchmark]: Toolchain (without parser) took 27470.94 ms. Allocated memory was 148.4 MB in the beginning and 584.1 MB in the end (delta: 435.7 MB). Free memory was 101.7 MB in the beginning and 102.5 MB in the end (delta: -753.3 kB). Peak memory consumption was 434.9 MB. Max. memory is 7.1 GB. [2020-10-14 02:31:48,881 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 148.4 MB. Free memory was 121.7 MB in the beginning and 121.3 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. [2020-10-14 02:31:48,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.64 ms. Allocated memory was 148.4 MB in the beginning and 207.1 MB in the end (delta: 58.7 MB). Free memory was 101.3 MB in the beginning and 172.9 MB in the end (delta: -71.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2020-10-14 02:31:48,883 INFO L168 Benchmark]: Boogie Preprocessor took 144.36 ms. Allocated memory is still 207.1 MB. Free memory was 172.9 MB in the beginning and 168.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-10-14 02:31:48,884 INFO L168 Benchmark]: RCFGBuilder took 1241.68 ms. Allocated memory was 207.1 MB in the beginning and 235.4 MB in the end (delta: 28.3 MB). Free memory was 168.0 MB in the beginning and 174.9 MB in the end (delta: -6.9 MB). Peak memory consumption was 77.9 MB. Max. memory is 7.1 GB. [2020-10-14 02:31:48,885 INFO L168 Benchmark]: TraceAbstraction took 25268.71 ms. Allocated memory was 235.4 MB in the beginning and 584.1 MB in the end (delta: 348.7 MB). Free memory was 174.9 MB in the beginning and 102.5 MB in the end (delta: 72.5 MB). Peak memory consumption was 421.1 MB. Max. memory is 7.1 GB. [2020-10-14 02:31:48,889 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 148.4 MB. Free memory was 121.7 MB in the beginning and 121.3 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.64 ms. Allocated memory was 148.4 MB in the beginning and 207.1 MB in the end (delta: 58.7 MB). Free memory was 101.3 MB in the beginning and 172.9 MB in the end (delta: -71.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.36 ms. Allocated memory is still 207.1 MB. Free memory was 172.9 MB in the beginning and 168.0 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1241.68 ms. Allocated memory was 207.1 MB in the beginning and 235.4 MB in the end (delta: 28.3 MB). Free memory was 168.0 MB in the beginning and 174.9 MB in the end (delta: -6.9 MB). Peak memory consumption was 77.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25268.71 ms. Allocated memory was 235.4 MB in the beginning and 584.1 MB in the end (delta: 348.7 MB). Free memory was 174.9 MB in the beginning and 102.5 MB in the end (delta: 72.5 MB). Peak memory consumption was 421.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 64]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L527] a1 = (((a1 * 5) + 278443) - -239546) [L528] return 26; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND TRUE ((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14))) [L437] a1 = (((((a1 / 5) % 89)- -128) / 5) + 34) [L438] a10 = 0 [L439] a19 = 8 [L441] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND TRUE (((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) [L64] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.1s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 254 SDtfs, 3512 SDslu, 247 SDs, 0 SdLazy, 8129 SolverSat, 1237 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2374occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1000 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1699 NumberOfCodeBlocks, 1699 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1413 ConstructedInterpolants, 0 QuantifiedInterpolants, 908581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 488/566 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...