/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_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-14 02:30:44,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-14 02:30:44,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-14 02:30:44,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-14 02:30:44,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-14 02:30:44,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-14 02:30:44,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-14 02:30:44,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-14 02:30:44,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-14 02:30:44,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-14 02:30:44,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-14 02:30:44,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-14 02:30:44,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-14 02:30:44,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-14 02:30:44,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-14 02:30:44,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-14 02:30:44,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-14 02:30:44,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-14 02:30:44,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-14 02:30:44,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-14 02:30:44,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-14 02:30:44,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-14 02:30:44,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-14 02:30:44,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-14 02:30:44,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-14 02:30:44,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-14 02:30:44,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-14 02:30:44,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-14 02:30:44,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-14 02:30:44,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-14 02:30:44,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-14 02:30:44,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-14 02:30:44,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-14 02:30:44,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-14 02:30:44,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-14 02:30:44,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-14 02:30:44,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-14 02:30:44,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-14 02:30:44,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-14 02:30:44,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-14 02:30:44,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-14 02:30:44,803 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:30:44,824 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-14 02:30:44,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-14 02:30:44,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-14 02:30:44,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-14 02:30:44,826 INFO L138 SettingsManager]: * Use SBE=true [2020-10-14 02:30:44,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-14 02:30:44,826 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-14 02:30:44,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-14 02:30:44,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-14 02:30:44,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-14 02:30:44,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-14 02:30:44,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-14 02:30:44,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-14 02:30:44,827 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-14 02:30:44,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-14 02:30:44,828 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-14 02:30:44,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-14 02:30:44,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-14 02:30:44,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-14 02:30:44,829 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-14 02:30:44,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-14 02:30:44,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-14 02:30:44,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-14 02:30:44,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-14 02:30:44,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-14 02:30:44,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-14 02:30:44,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-14 02:30:44,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-14 02:30:44,830 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-14 02:30:44,830 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:30:45,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-14 02:30:45,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-14 02:30:45,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-14 02:30:45,149 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-14 02:30:45,149 INFO L275 PluginConnector]: CDTParser initialized [2020-10-14 02:30:45,150 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label28.c [2020-10-14 02:30:45,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/03dc9081e/1b9b01b4e2d94ef09cea6b0de4ed390e/FLAG043af1ccb [2020-10-14 02:30:45,795 INFO L306 CDTParser]: Found 1 translation units. [2020-10-14 02:30:45,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label28.c [2020-10-14 02:30:45,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/03dc9081e/1b9b01b4e2d94ef09cea6b0de4ed390e/FLAG043af1ccb [2020-10-14 02:30:46,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/03dc9081e/1b9b01b4e2d94ef09cea6b0de4ed390e [2020-10-14 02:30:46,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-14 02:30:46,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-14 02:30:46,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-14 02:30:46,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-14 02:30:46,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-14 02:30:46,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:30:46" (1/1) ... [2020-10-14 02:30:46,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c56d103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46, skipping insertion in model container [2020-10-14 02:30:46,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:30:46" (1/1) ... [2020-10-14 02:30:46,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-14 02:30:46,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-14 02:30:46,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 02:30:46,772 INFO L203 MainTranslator]: Completed pre-run [2020-10-14 02:30:46,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 02:30:46,939 INFO L208 MainTranslator]: Completed translation [2020-10-14 02:30:46,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46 WrapperNode [2020-10-14 02:30:46,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-14 02:30:46,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-14 02:30:46,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-14 02:30:46,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-14 02:30:46,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46" (1/1) ... [2020-10-14 02:30:46,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46" (1/1) ... [2020-10-14 02:30:46,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46" (1/1) ... [2020-10-14 02:30:46,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46" (1/1) ... [2020-10-14 02:30:47,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46" (1/1) ... [2020-10-14 02:30:47,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46" (1/1) ... [2020-10-14 02:30:47,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46" (1/1) ... [2020-10-14 02:30:47,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-14 02:30:47,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-14 02:30:47,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-14 02:30:47,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-14 02:30:47,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46" (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:30:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-14 02:30:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-14 02:30:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-14 02:30:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-14 02:30:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-14 02:30:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-14 02:30:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-14 02:30:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-14 02:30:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-14 02:30:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-14 02:30:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-14 02:30:48,428 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-14 02:30:48,428 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-14 02:30:48,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:30:48 BoogieIcfgContainer [2020-10-14 02:30:48,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-14 02:30:48,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-14 02:30:48,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-14 02:30:48,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-14 02:30:48,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:30:46" (1/3) ... [2020-10-14 02:30:48,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635d10e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:30:48, skipping insertion in model container [2020-10-14 02:30:48,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:30:46" (2/3) ... [2020-10-14 02:30:48,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635d10e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:30:48, skipping insertion in model container [2020-10-14 02:30:48,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:30:48" (3/3) ... [2020-10-14 02:30:48,443 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label28.c [2020-10-14 02:30:48,455 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-14 02:30:48,464 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-14 02:30:48,480 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-14 02:30:48,512 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-14 02:30:48,513 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-14 02:30:48,513 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-14 02:30:48,513 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-14 02:30:48,513 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-14 02:30:48,513 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-14 02:30:48,514 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-14 02:30:48,514 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-14 02:30:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-14 02:30:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-14 02:30:48,546 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:30:48,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:30:48,548 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:30:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:30:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash 7815070, now seen corresponding path program 1 times [2020-10-14 02:30:48,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:30:48,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [92329786] [2020-10-14 02:30:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:30:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:48,784 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:49,076 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:49,077 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 25 [2020-10-14 02:30:49,077 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:49,077 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 359 [2020-10-14 02:30:49,080 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:49,080 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:49,080 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 02:30:49,081 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 02:30:49,081 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 19 [2020-10-14 02:30:49,081 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 02:30:49,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:30:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:49,188 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:49,198 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:49,198 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:30:49,199 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:49,199 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-10-14 02:30:49,199 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:49,199 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:49,200 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:30:49,200 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:49,200 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 02:30:49,200 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:49,212 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:30:49,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [92329786] [2020-10-14 02:30:49,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 02:30:49,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-14 02:30:49,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658447509] [2020-10-14 02:30:49,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:30:49,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:30:49,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:30:49,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:30:49,246 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-10-14 02:30:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:30:51,481 INFO L93 Difference]: Finished difference Result 730 states and 1300 transitions. [2020-10-14 02:30:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-14 02:30:51,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-14 02:30:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:30:51,502 INFO L225 Difference]: With dead ends: 730 [2020-10-14 02:30:51,503 INFO L226 Difference]: Without dead ends: 447 [2020-10-14 02:30:51,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:30:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-10-14 02:30:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2020-10-14 02:30:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-10-14 02:30:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 615 transitions. [2020-10-14 02:30:51,598 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 615 transitions. Word has length 17 [2020-10-14 02:30:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:30:51,599 INFO L479 AbstractCegarLoop]: Abstraction has 443 states and 615 transitions. [2020-10-14 02:30:51,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:30:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 615 transitions. [2020-10-14 02:30:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-14 02:30:51,603 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:30:51,604 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-14 02:30:51,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-14 02:30:51,604 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:30:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:30:51,605 INFO L82 PathProgramCache]: Analyzing trace with hash 556045594, now seen corresponding path program 1 times [2020-10-14 02:30:51,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:30:51,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [683283966] [2020-10-14 02:30:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:30:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:51,699 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:51,827 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:52,186 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:52,186 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-14 02:30:52,186 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 02:30:52,186 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 534 [2020-10-14 02:30:52,187 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:52,188 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:52,188 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:52,188 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-14 02:30:52,188 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 16 [2020-10-14 02:30:52,188 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:52,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:30:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:52,246 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:52,249 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:52,250 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:30:52,250 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:52,250 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-14 02:30:52,251 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:52,251 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:52,253 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:30:52,253 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:52,253 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:30:52,254 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 02:30:52,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:30:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:52,299 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:52,370 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:52,377 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 02:30:52,378 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:52,378 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 80 [2020-10-14 02:30:52,378 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:52,378 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:52,379 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:30:52,381 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:52,381 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-14 02:30:52,382 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 02:30:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 02:30:52,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [683283966] [2020-10-14 02:30:52,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:30:52,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 02:30:52,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773228154] [2020-10-14 02:30:52,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:30:52,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:30:52,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:30:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:30:52,446 INFO L87 Difference]: Start difference. First operand 443 states and 615 transitions. Second operand 5 states. [2020-10-14 02:30:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:30:53,609 INFO L93 Difference]: Finished difference Result 1319 states and 1875 transitions. [2020-10-14 02:30:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:30:53,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-10-14 02:30:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:30:53,618 INFO L225 Difference]: With dead ends: 1319 [2020-10-14 02:30:53,618 INFO L226 Difference]: Without dead ends: 882 [2020-10-14 02:30:53,621 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:30:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2020-10-14 02:30:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 878. [2020-10-14 02:30:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-10-14 02:30:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1181 transitions. [2020-10-14 02:30:53,676 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1181 transitions. Word has length 87 [2020-10-14 02:30:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:30:53,677 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1181 transitions. [2020-10-14 02:30:53,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:30:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1181 transitions. [2020-10-14 02:30:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-14 02:30:53,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:30:53,689 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:30:53,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-14 02:30:53,689 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:30:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:30:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1392486162, now seen corresponding path program 1 times [2020-10-14 02:30:53,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:30:53,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [769550757] [2020-10-14 02:30:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:30:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:53,786 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:53,965 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:54,139 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:54,565 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:55,051 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:55,052 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 181 [2020-10-14 02:30:55,052 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-14 02:30:55,052 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1291 [2020-10-14 02:30:55,053 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:55,053 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:55,053 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:55,053 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 02:30:55,053 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-14 02:30:55,054 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:55,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:30:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:55,113 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:55,116 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:55,116 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:30:55,116 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:55,117 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 02:30:55,117 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:55,117 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:55,117 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:30:55,118 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:55,118 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:30:55,118 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:55,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:30:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:55,156 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:55,207 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:55,208 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 02:30:55,208 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:55,208 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 61 [2020-10-14 02:30:55,208 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:55,209 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:55,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:30:55,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:55,209 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 02:30:55,210 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:55,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-14 02:30:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:55,261 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:55,388 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:55,388 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-14 02:30:55,389 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:55,389 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 135 [2020-10-14 02:30:55,389 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:55,389 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:55,390 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:55,390 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:30:55,390 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 02:30:55,390 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:30:55,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [769550757] [2020-10-14 02:30:55,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:30:55,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:30:55,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380834388] [2020-10-14 02:30:55,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:30:55,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:30:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:30:55,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:30:55,475 INFO L87 Difference]: Start difference. First operand 878 states and 1181 transitions. Second operand 7 states. [2020-10-14 02:30:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:30:57,226 INFO L93 Difference]: Finished difference Result 2299 states and 3401 transitions. [2020-10-14 02:30:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 02:30:57,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2020-10-14 02:30:57,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:30:57,240 INFO L225 Difference]: With dead ends: 2299 [2020-10-14 02:30:57,241 INFO L226 Difference]: Without dead ends: 964 [2020-10-14 02:30:57,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-14 02:30:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2020-10-14 02:30:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 890. [2020-10-14 02:30:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2020-10-14 02:30:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1162 transitions. [2020-10-14 02:30:57,342 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1162 transitions. Word has length 169 [2020-10-14 02:30:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:30:57,345 INFO L479 AbstractCegarLoop]: Abstraction has 890 states and 1162 transitions. [2020-10-14 02:30:57,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:30:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1162 transitions. [2020-10-14 02:30:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-14 02:30:57,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:30:57,364 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-14 02:30:57,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-14 02:30:57,365 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:30:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:30:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash 552964622, now seen corresponding path program 1 times [2020-10-14 02:30:57,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:30:57,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [995567613] [2020-10-14 02:30:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:30:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:57,484 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:57,702 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:58,401 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:58,402 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 197 [2020-10-14 02:30:58,402 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 02:30:58,402 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 953 [2020-10-14 02:30:58,402 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:58,403 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:58,403 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:58,403 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-14 02:30:58,403 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 101 [2020-10-14 02:30:58,403 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:58,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:30:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:58,458 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:58,462 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:58,463 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:30:58,463 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:58,463 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-14 02:30:58,463 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:58,464 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:58,464 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:30:58,464 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:58,464 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:30:58,464 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:58,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:30:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:58,496 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:58,547 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:58,547 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 02:30:58,547 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:58,548 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-10-14 02:30:58,548 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:58,548 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:58,548 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:30:58,549 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:58,549 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-14 02:30:58,549 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:58,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-14 02:30:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:58,606 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:58,745 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:58,747 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-14 02:30:58,747 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:58,747 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 153 [2020-10-14 02:30:58,748 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:58,748 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:58,748 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:58,748 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:30:58,749 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-14 02:30:58,749 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:30:58,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [995567613] [2020-10-14 02:30:58,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:30:58,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:30:58,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752491716] [2020-10-14 02:30:58,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:30:58,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:30:58,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:30:58,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:30:58,842 INFO L87 Difference]: Start difference. First operand 890 states and 1162 transitions. Second operand 7 states. [2020-10-14 02:31:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:00,269 INFO L93 Difference]: Finished difference Result 1802 states and 2363 transitions. [2020-10-14 02:31:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 02:31:00,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2020-10-14 02:31:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:00,276 INFO L225 Difference]: With dead ends: 1802 [2020-10-14 02:31:00,277 INFO L226 Difference]: Without dead ends: 918 [2020-10-14 02:31:00,281 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-14 02:31:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2020-10-14 02:31:00,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 898. [2020-10-14 02:31:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2020-10-14 02:31:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1064 transitions. [2020-10-14 02:31:00,318 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1064 transitions. Word has length 185 [2020-10-14 02:31:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:00,320 INFO L479 AbstractCegarLoop]: Abstraction has 898 states and 1064 transitions. [2020-10-14 02:31:00,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1064 transitions. [2020-10-14 02:31:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-10-14 02:31:00,324 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:00,325 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:00,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-14 02:31:00,325 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:00,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1276300145, now seen corresponding path program 1 times [2020-10-14 02:31:00,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:00,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1634377091] [2020-10-14 02:31:00,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:00,389 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:00,668 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:01,551 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:01,551 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 204 [2020-10-14 02:31:01,551 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 02:31:01,551 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1183 [2020-10-14 02:31:01,552 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:01,552 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:01,552 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:01,552 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 187 [2020-10-14 02:31:01,552 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 16 [2020-10-14 02:31:01,553 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:01,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:01,621 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:01,626 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:01,627 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:01,630 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:01,630 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-14 02:31:01,630 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:01,631 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:01,631 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:01,631 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:01,631 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:01,632 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:01,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:01,648 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:01,668 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:01,669 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 02:31:01,669 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:01,669 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 21 [2020-10-14 02:31:01,669 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:01,669 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:01,670 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:01,673 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:01,673 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:01,673 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 02:31:01,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-14 02:31:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:01,726 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:01,790 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:01,791 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-14 02:31:01,791 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:01,791 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 78 [2020-10-14 02:31:01,792 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:01,792 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:01,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:01,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:01,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-14 02:31:01,793 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2020-10-14 02:31:01,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1634377091] [2020-10-14 02:31:01,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:01,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 02:31:01,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736082881] [2020-10-14 02:31:01,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:31:01,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:31:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:31:01,868 INFO L87 Difference]: Start difference. First operand 898 states and 1064 transitions. Second operand 5 states. [2020-10-14 02:31:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:03,237 INFO L93 Difference]: Finished difference Result 2527 states and 3055 transitions. [2020-10-14 02:31:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:31:03,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2020-10-14 02:31:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:03,252 INFO L225 Difference]: With dead ends: 2527 [2020-10-14 02:31:03,253 INFO L226 Difference]: Without dead ends: 1635 [2020-10-14 02:31:03,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2020-10-14 02:31:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1339. [2020-10-14 02:31:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2020-10-14 02:31:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1642 transitions. [2020-10-14 02:31:03,340 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1642 transitions. Word has length 192 [2020-10-14 02:31:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:03,340 INFO L479 AbstractCegarLoop]: Abstraction has 1339 states and 1642 transitions. [2020-10-14 02:31:03,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:31:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1642 transitions. [2020-10-14 02:31:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-10-14 02:31:03,352 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:03,353 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-14 02:31:03,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-14 02:31:03,353 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:03,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:03,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1368010915, now seen corresponding path program 1 times [2020-10-14 02:31:03,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:03,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1879259652] [2020-10-14 02:31:03,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:03,460 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:03,588 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:04,691 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:05,688 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:08,275 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:08,276 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 300 [2020-10-14 02:31:08,276 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-14 02:31:08,276 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4851 [2020-10-14 02:31:08,276 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:08,277 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:08,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:08,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 161 [2020-10-14 02:31:08,277 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 123 [2020-10-14 02:31:08,277 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:08,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:08,341 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:08,343 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:08,344 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:08,344 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:08,344 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:31:08,344 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:08,345 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:08,345 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:08,345 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:08,345 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:08,345 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:08,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:08,378 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:08,395 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:08,395 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 02:31:08,395 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:08,396 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 17 [2020-10-14 02:31:08,396 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:08,396 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:08,396 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:08,396 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:08,397 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:08,397 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:08,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-14 02:31:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:08,432 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:08,464 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:08,464 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-14 02:31:08,464 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:08,465 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 38 [2020-10-14 02:31:08,465 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:08,465 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:08,465 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:08,465 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:08,466 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-10-14 02:31:08,466 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:08,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-14 02:31:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:08,530 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:08,697 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:08,697 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-10-14 02:31:08,698 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:08,698 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 182 [2020-10-14 02:31:08,698 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:08,698 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:08,698 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:08,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:08,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 121 [2020-10-14 02:31:08,699 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-10-14 02:31:08,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1879259652] [2020-10-14 02:31:08,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:08,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:31:08,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141050719] [2020-10-14 02:31:08,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:08,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:08,852 INFO L87 Difference]: Start difference. First operand 1339 states and 1642 transitions. Second operand 7 states. [2020-10-14 02:31:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:10,498 INFO L93 Difference]: Finished difference Result 3326 states and 4309 transitions. [2020-10-14 02:31:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-14 02:31:10,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 286 [2020-10-14 02:31:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:10,512 INFO L225 Difference]: With dead ends: 3326 [2020-10-14 02:31:10,512 INFO L226 Difference]: Without dead ends: 1993 [2020-10-14 02:31:10,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-14 02:31:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2020-10-14 02:31:10,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1933. [2020-10-14 02:31:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2020-10-14 02:31:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2342 transitions. [2020-10-14 02:31:10,585 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2342 transitions. Word has length 286 [2020-10-14 02:31:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:10,586 INFO L479 AbstractCegarLoop]: Abstraction has 1933 states and 2342 transitions. [2020-10-14 02:31:10,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2342 transitions. [2020-10-14 02:31:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2020-10-14 02:31:10,596 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:10,596 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-14 02:31:10,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-14 02:31:10,597 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:10,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:10,597 INFO L82 PathProgramCache]: Analyzing trace with hash -592355311, now seen corresponding path program 1 times [2020-10-14 02:31:10,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:10,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [668380160] [2020-10-14 02:31:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:10,665 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:10,752 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:10,827 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:13,943 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:15,660 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:15,660 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 310 [2020-10-14 02:31:15,661 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-14 02:31:15,661 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5015 [2020-10-14 02:31:15,661 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:15,661 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:15,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:15,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 171 [2020-10-14 02:31:15,662 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 123 [2020-10-14 02:31:15,662 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:15,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:15,722 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:15,724 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:15,724 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:15,725 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:15,725 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:31:15,725 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:15,725 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:15,726 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:15,726 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:15,726 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:15,726 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:15,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:15,750 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:15,766 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:15,766 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 02:31:15,767 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:15,767 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 17 [2020-10-14 02:31:15,767 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:15,768 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:15,768 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:15,768 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:15,768 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:15,768 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:15,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-14 02:31:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:15,812 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:15,881 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:15,881 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 83 [2020-10-14 02:31:15,882 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:15,882 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 78 [2020-10-14 02:31:15,883 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:15,883 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:15,883 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:15,884 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:15,884 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-10-14 02:31:15,884 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:15,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-10-14 02:31:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:15,959 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:16,143 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:16,143 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-10-14 02:31:16,143 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:16,144 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 204 [2020-10-14 02:31:16,144 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:16,144 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:16,144 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:16,144 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:16,145 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 121 [2020-10-14 02:31:16,145 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 188 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-10-14 02:31:16,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [668380160] [2020-10-14 02:31:16,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:16,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:31:16,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036131056] [2020-10-14 02:31:16,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:16,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:16,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:16,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:16,380 INFO L87 Difference]: Start difference. First operand 1933 states and 2342 transitions. Second operand 7 states. [2020-10-14 02:31:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:17,916 INFO L93 Difference]: Finished difference Result 4333 states and 5425 transitions. [2020-10-14 02:31:17,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 02:31:17,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 296 [2020-10-14 02:31:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:17,929 INFO L225 Difference]: With dead ends: 4333 [2020-10-14 02:31:17,929 INFO L226 Difference]: Without dead ends: 1816 [2020-10-14 02:31:17,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-14 02:31:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2020-10-14 02:31:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1778. [2020-10-14 02:31:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2020-10-14 02:31:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2135 transitions. [2020-10-14 02:31:17,996 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2135 transitions. Word has length 296 [2020-10-14 02:31:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:17,996 INFO L479 AbstractCegarLoop]: Abstraction has 1778 states and 2135 transitions. [2020-10-14 02:31:17,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2135 transitions. [2020-10-14 02:31:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-10-14 02:31:18,005 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:18,005 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-14 02:31:18,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-14 02:31:18,006 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:18,006 INFO L82 PathProgramCache]: Analyzing trace with hash -289235378, now seen corresponding path program 1 times [2020-10-14 02:31:18,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:18,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1349619788] [2020-10-14 02:31:18,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:18,076 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:18,175 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:19,197 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:20,702 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:20,703 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 313 [2020-10-14 02:31:20,703 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 02:31:20,703 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2649 [2020-10-14 02:31:20,703 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:20,704 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:20,704 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:20,704 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-14 02:31:20,704 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 88 [2020-10-14 02:31:20,704 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:20,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:20,764 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:20,765 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:20,766 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:20,766 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:20,766 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1 [2020-10-14 02:31:20,766 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:20,767 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:20,767 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:20,767 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:20,767 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:20,767 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:20,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:20,803 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:20,852 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:20,852 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 02:31:20,852 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:20,853 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 56 [2020-10-14 02:31:20,853 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:20,853 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:20,854 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:20,854 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:20,854 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-14 02:31:20,855 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:20,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-14 02:31:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:20,905 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:20,999 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:20,999 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 86 [2020-10-14 02:31:20,999 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:21,000 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 104 [2020-10-14 02:31:21,000 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:21,000 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:21,001 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:21,001 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:21,001 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 86 [2020-10-14 02:31:21,001 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:21,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2020-10-14 02:31:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:21,093 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:21,134 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:21,134 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-10-14 02:31:21,134 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:21,134 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 54 [2020-10-14 02:31:21,134 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:21,135 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:21,135 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:21,135 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 118 [2020-10-14 02:31:21,135 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:21,135 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 108 proven. 84 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-14 02:31:21,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1349619788] [2020-10-14 02:31:21,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:21,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:31:21,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556136303] [2020-10-14 02:31:21,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:21,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:21,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:21,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:21,248 INFO L87 Difference]: Start difference. First operand 1778 states and 2135 transitions. Second operand 7 states. [2020-10-14 02:31:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:22,680 INFO L93 Difference]: Finished difference Result 3866 states and 4707 transitions. [2020-10-14 02:31:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 02:31:22,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 299 [2020-10-14 02:31:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:22,692 INFO L225 Difference]: With dead ends: 3866 [2020-10-14 02:31:22,692 INFO L226 Difference]: Without dead ends: 2094 [2020-10-14 02:31:22,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 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:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2020-10-14 02:31:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2080. [2020-10-14 02:31:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2080 states. [2020-10-14 02:31:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2488 transitions. [2020-10-14 02:31:22,755 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 2488 transitions. Word has length 299 [2020-10-14 02:31:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:22,756 INFO L479 AbstractCegarLoop]: Abstraction has 2080 states and 2488 transitions. [2020-10-14 02:31:22,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2488 transitions. [2020-10-14 02:31:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2020-10-14 02:31:22,764 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:22,764 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2020-10-14 02:31:22,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-14 02:31:22,765 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:22,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1654194082, now seen corresponding path program 1 times [2020-10-14 02:31:22,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:22,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1958613373] [2020-10-14 02:31:22,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-14 02:31:22,866 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-14 02:31:22,866 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-14 02:31:22,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-14 02:31:22,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:31:22 BoogieIcfgContainer [2020-10-14 02:31:22,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-14 02:31:22,928 INFO L168 Benchmark]: Toolchain (without parser) took 36864.97 ms. Allocated memory was 147.8 MB in the beginning and 800.1 MB in the end (delta: 652.2 MB). Free memory was 102.2 MB in the beginning and 150.6 MB in the end (delta: -48.3 MB). Peak memory consumption was 603.9 MB. Max. memory is 7.1 GB. [2020-10-14 02:31:22,929 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.0 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. [2020-10-14 02:31:22,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 876.04 ms. Allocated memory was 147.8 MB in the beginning and 206.0 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 171.5 MB in the end (delta: -69.6 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. [2020-10-14 02:31:22,931 INFO L168 Benchmark]: Boogie Preprocessor took 111.83 ms. Allocated memory is still 206.0 MB. Free memory was 171.5 MB in the beginning and 166.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-10-14 02:31:22,932 INFO L168 Benchmark]: RCFGBuilder took 1381.92 ms. Allocated memory was 206.0 MB in the beginning and 238.6 MB in the end (delta: 32.5 MB). Free memory was 166.5 MB in the beginning and 179.8 MB in the end (delta: -13.4 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2020-10-14 02:31:22,933 INFO L168 Benchmark]: TraceAbstraction took 34490.05 ms. Allocated memory was 238.6 MB in the beginning and 800.1 MB in the end (delta: 561.5 MB). Free memory was 178.1 MB in the beginning and 150.6 MB in the end (delta: 27.6 MB). Peak memory consumption was 589.1 MB. Max. memory is 7.1 GB. [2020-10-14 02:31:22,936 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 147.8 MB. Free memory was 122.4 MB in the beginning and 122.0 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 876.04 ms. Allocated memory was 147.8 MB in the beginning and 206.0 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 171.5 MB in the end (delta: -69.6 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.83 ms. Allocated memory is still 206.0 MB. Free memory was 171.5 MB in the beginning and 166.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1381.92 ms. Allocated memory was 206.0 MB in the beginning and 238.6 MB in the end (delta: 32.5 MB). Free memory was 166.5 MB in the beginning and 179.8 MB in the end (delta: -13.4 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34490.05 ms. Allocated memory was 238.6 MB in the beginning and 800.1 MB in the end (delta: 561.5 MB). Free memory was 178.1 MB in the beginning and 150.6 MB in the end (delta: 27.6 MB). Peak memory consumption was 589.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: 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 TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [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 TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L287] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L288] a19 = 10 [L290] return 25; [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 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 TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L455] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L456] a10 = 2 [L457] a19 = 7 [L459] 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 TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) [L37] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 34.3s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 257 SDtfs, 2992 SDslu, 327 SDs, 0 SdLazy, 7972 SolverSat, 1089 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2080occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 510 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 1868 NumberOfCodeBlocks, 1868 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1523 ConstructedInterpolants, 0 QuantifiedInterpolants, 703949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 981/1076 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...