/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 SingleStatement --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=1.0 --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-25 09:05:12,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-25 09:05:12,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-25 09:05:12,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-25 09:05:12,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-25 09:05:12,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-25 09:05:12,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-25 09:05:12,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-25 09:05:12,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-25 09:05:12,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-25 09:05:12,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-25 09:05:12,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-25 09:05:12,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-25 09:05:12,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-25 09:05:12,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-25 09:05:12,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-25 09:05:12,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-25 09:05:12,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-25 09:05:12,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-25 09:05:12,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-25 09:05:12,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-25 09:05:12,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-25 09:05:12,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-25 09:05:12,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-25 09:05:12,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-25 09:05:12,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-25 09:05:12,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-25 09:05:12,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-25 09:05:12,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-25 09:05:12,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-25 09:05:12,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-25 09:05:12,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-25 09:05:12,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-25 09:05:12,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-25 09:05:12,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-25 09:05:12,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-25 09:05:12,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-25 09:05:12,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-25 09:05:12,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-25 09:05:12,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-25 09:05:12,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-25 09:05:12,812 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-09-25 09:05:12,837 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-25 09:05:12,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-25 09:05:12,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-25 09:05:12,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-25 09:05:12,839 INFO L138 SettingsManager]: * Use SBE=true [2020-09-25 09:05:12,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-25 09:05:12,840 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-25 09:05:12,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-25 09:05:12,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-25 09:05:12,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-25 09:05:12,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-25 09:05:12,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-25 09:05:12,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-25 09:05:12,841 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-25 09:05:12,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-25 09:05:12,841 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-25 09:05:12,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-25 09:05:12,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-25 09:05:12,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-25 09:05:12,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-25 09:05:12,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-25 09:05:12,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-25 09:05:12,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-25 09:05:12,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-25 09:05:12,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-25 09:05:12,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-25 09:05:12,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-25 09:05:12,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-25 09:05:12,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-25 09:05:12,844 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 -> SingleStatement 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=1.0;log-additional-information=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=1.0;log-additional-information=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=1.0;log-additional-information=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=1.0;log-additional-information=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=1.0;log-additional-information=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=1.0;log-additional-information=true; [2020-09-25 09:05:13,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-25 09:05:13,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-25 09:05:13,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-25 09:05:13,405 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-25 09:05:13,407 INFO L275 PluginConnector]: CDTParser initialized [2020-09-25 09:05:13,408 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-25 09:05:13,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/650dbe45c/4abc32cf58fa41ce87b06512667047ff/FLAGb971b8f2b [2020-09-25 09:05:14,185 INFO L306 CDTParser]: Found 1 translation units. [2020-09-25 09:05:14,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-25 09:05:14,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/650dbe45c/4abc32cf58fa41ce87b06512667047ff/FLAGb971b8f2b [2020-09-25 09:05:14,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/650dbe45c/4abc32cf58fa41ce87b06512667047ff [2020-09-25 09:05:14,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-25 09:05:14,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-25 09:05:14,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-25 09:05:14,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-25 09:05:14,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-25 09:05:14,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 09:05:14" (1/1) ... [2020-09-25 09:05:14,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446f26ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:14, skipping insertion in model container [2020-09-25 09:05:14,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 09:05:14" (1/1) ... [2020-09-25 09:05:14,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-25 09:05:14,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-25 09:05:15,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 09:05:15,140 INFO L203 MainTranslator]: Completed pre-run [2020-09-25 09:05:15,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 09:05:15,318 INFO L208 MainTranslator]: Completed translation [2020-09-25 09:05:15,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:15 WrapperNode [2020-09-25 09:05:15,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-25 09:05:15,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-25 09:05:15,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-25 09:05:15,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-25 09:05:15,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:15" (1/1) ... [2020-09-25 09:05:15,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:15" (1/1) ... [2020-09-25 09:05:15,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:15" (1/1) ... [2020-09-25 09:05:15,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:15" (1/1) ... [2020-09-25 09:05:15,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:15" (1/1) ... [2020-09-25 09:05:15,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:15" (1/1) ... [2020-09-25 09:05:15,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:15" (1/1) ... [2020-09-25 09:05:15,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-25 09:05:15,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-25 09:05:15,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-25 09:05:15,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-25 09:05:15,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:15" (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-09-25 09:05:15,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-25 09:05:15,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-25 09:05:15,561 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-25 09:05:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-25 09:05:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-25 09:05:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-25 09:05:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-25 09:05:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-25 09:05:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-25 09:05:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-25 09:05:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-25 09:05:17,028 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-25 09:05:17,028 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-25 09:05:17,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 09:05:17 BoogieIcfgContainer [2020-09-25 09:05:17,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-25 09:05:17,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-25 09:05:17,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-25 09:05:17,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-25 09:05:17,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 09:05:14" (1/3) ... [2020-09-25 09:05:17,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69adbd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 09:05:17, skipping insertion in model container [2020-09-25 09:05:17,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 09:05:15" (2/3) ... [2020-09-25 09:05:17,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69adbd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 09:05:17, skipping insertion in model container [2020-09-25 09:05:17,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 09:05:17" (3/3) ... [2020-09-25 09:05:17,047 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label15.c [2020-09-25 09:05:17,060 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-25 09:05:17,072 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-25 09:05:17,095 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-25 09:05:17,135 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-25 09:05:17,135 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-25 09:05:17,135 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-25 09:05:17,137 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-25 09:05:17,137 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-25 09:05:17,137 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-25 09:05:17,137 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-25 09:05:17,137 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-25 09:05:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-25 09:05:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-25 09:05:17,180 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:05:17,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 09:05:17,182 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:05:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:05:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1814812065, now seen corresponding path program 1 times [2020-09-25 09:05:17,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:05:17,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [766514752] [2020-09-25 09:05:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:05:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:17,385 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:17,567 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:17,590 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:17,855 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:17,855 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 38 [2020-09-25 09:05:17,856 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 09:05:17,856 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 504 [2020-09-25 09:05:17,860 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:17,860 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:17,861 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 09:05:17,861 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 11 [2020-09-25 09:05:17,861 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-09-25 09:05:17,861 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-09-25 09:05:17,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:05:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:17,989 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:18,019 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:18,020 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:05:18,020 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:18,021 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 34 [2020-09-25 09:05:18,021 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:18,022 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:18,022 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 09:05:18,022 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:18,023 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 7 [2020-09-25 09:05:18,024 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-25 09:05:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 09:05:18,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [766514752] [2020-09-25 09:05:18,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 09:05:18,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-25 09:05:18,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586753201] [2020-09-25 09:05:18,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-25 09:05:18,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:05:18,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-25 09:05:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-25 09:05:18,093 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-25 09:05:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:05:20,148 INFO L93 Difference]: Finished difference Result 1104 states and 1521 transitions. [2020-09-25 09:05:20,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-25 09:05:20,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-09-25 09:05:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:05:20,172 INFO L225 Difference]: With dead ends: 1104 [2020-09-25 09:05:20,172 INFO L226 Difference]: Without dead ends: 578 [2020-09-25 09:05:20,183 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-25 09:05:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-09-25 09:05:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 544. [2020-09-25 09:05:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-09-25 09:05:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 655 transitions. [2020-09-25 09:05:20,277 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 655 transitions. Word has length 29 [2020-09-25 09:05:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:05:20,278 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 655 transitions. [2020-09-25 09:05:20,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-25 09:05:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 655 transitions. [2020-09-25 09:05:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-25 09:05:20,284 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:05:20,284 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 09:05:20,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-25 09:05:20,285 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:05:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:05:20,286 INFO L82 PathProgramCache]: Analyzing trace with hash -908534672, now seen corresponding path program 1 times [2020-09-25 09:05:20,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:05:20,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1570697593] [2020-09-25 09:05:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:05:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:20,361 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:20,565 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:20,720 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:20,935 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:21,357 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:23,122 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:23,122 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 119 [2020-09-25 09:05:23,122 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-09-25 09:05:23,123 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2794 [2020-09-25 09:05:23,123 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:23,123 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:23,123 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-09-25 09:05:23,124 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 12 [2020-09-25 09:05:23,124 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 106 [2020-09-25 09:05:23,124 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:23,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:05:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:23,220 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:23,235 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:23,236 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:05:23,236 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:23,236 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 17 [2020-09-25 09:05:23,237 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:23,237 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:23,237 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 09:05:23,237 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:23,238 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 8 [2020-09-25 09:05:23,238 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:23,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 09:05:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:23,313 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:23,384 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:23,451 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:23,452 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-25 09:05:23,452 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-25 09:05:23,452 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 152 [2020-09-25 09:05:23,452 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:23,453 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:23,453 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 09:05:23,454 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 09:05:23,454 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-25 09:05:23,454 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-25 09:05:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-25 09:05:23,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1570697593] [2020-09-25 09:05:23,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 09:05:23,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-25 09:05:23,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276786624] [2020-09-25 09:05:23,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-25 09:05:23,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:05:23,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-25 09:05:23,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-25 09:05:23,582 INFO L87 Difference]: Start difference. First operand 544 states and 655 transitions. Second operand 6 states. [2020-09-25 09:05:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:05:25,337 INFO L93 Difference]: Finished difference Result 1226 states and 1532 transitions. [2020-09-25 09:05:25,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-25 09:05:25,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2020-09-25 09:05:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:05:25,343 INFO L225 Difference]: With dead ends: 1226 [2020-09-25 09:05:25,344 INFO L226 Difference]: Without dead ends: 697 [2020-09-25 09:05:25,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-09-25 09:05:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2020-09-25 09:05:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2020-09-25 09:05:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2020-09-25 09:05:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 850 transitions. [2020-09-25 09:05:25,417 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 850 transitions. Word has length 108 [2020-09-25 09:05:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:05:25,418 INFO L479 AbstractCegarLoop]: Abstraction has 695 states and 850 transitions. [2020-09-25 09:05:25,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-25 09:05:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 850 transitions. [2020-09-25 09:05:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-25 09:05:25,422 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:05:25,423 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 09:05:25,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-25 09:05:25,423 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:05:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:05:25,424 INFO L82 PathProgramCache]: Analyzing trace with hash -162546798, now seen corresponding path program 1 times [2020-09-25 09:05:25,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:05:25,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1063797898] [2020-09-25 09:05:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:05:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:25,482 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:25,579 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:25,670 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:25,818 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:26,187 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:28,235 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:28,235 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 129 [2020-09-25 09:05:28,235 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-09-25 09:05:28,236 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2778 [2020-09-25 09:05:28,236 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:28,236 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:28,236 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-09-25 09:05:28,237 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 103 [2020-09-25 09:05:28,237 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-09-25 09:05:28,237 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:28,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:05:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:28,340 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:28,354 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:28,355 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:05:28,355 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:28,355 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 19 [2020-09-25 09:05:28,356 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:28,356 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:28,356 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 09:05:28,357 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:28,357 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 09:05:28,358 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:28,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 09:05:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:28,416 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:28,560 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:28,561 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 09:05:28,561 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:28,561 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 164 [2020-09-25 09:05:28,561 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:28,562 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:28,562 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 3 [2020-09-25 09:05:28,562 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:28,563 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-09-25 09:05:28,563 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 09:05:28,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1063797898] [2020-09-25 09:05:28,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 09:05:28,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-25 09:05:28,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139498331] [2020-09-25 09:05:28,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-25 09:05:28,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:05:28,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-25 09:05:28,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-25 09:05:28,625 INFO L87 Difference]: Start difference. First operand 695 states and 850 transitions. Second operand 6 states. [2020-09-25 09:05:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:05:31,491 INFO L93 Difference]: Finished difference Result 1909 states and 2489 transitions. [2020-09-25 09:05:31,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-25 09:05:31,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2020-09-25 09:05:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:05:31,502 INFO L225 Difference]: With dead ends: 1909 [2020-09-25 09:05:31,502 INFO L226 Difference]: Without dead ends: 1379 [2020-09-25 09:05:31,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-25 09:05:31,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-09-25 09:05:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1323. [2020-09-25 09:05:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2020-09-25 09:05:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1703 transitions. [2020-09-25 09:05:31,552 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1703 transitions. Word has length 118 [2020-09-25 09:05:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:05:31,553 INFO L479 AbstractCegarLoop]: Abstraction has 1323 states and 1703 transitions. [2020-09-25 09:05:31,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-25 09:05:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1703 transitions. [2020-09-25 09:05:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-25 09:05:31,557 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:05:31,557 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 09:05:31,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-25 09:05:31,558 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:05:31,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:05:31,558 INFO L82 PathProgramCache]: Analyzing trace with hash -878375990, now seen corresponding path program 1 times [2020-09-25 09:05:31,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:05:31,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190205856] [2020-09-25 09:05:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:05:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:31,610 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:31,802 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:31,890 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:32,966 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:32,967 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 131 [2020-09-25 09:05:32,967 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 09:05:32,967 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1379 [2020-09-25 09:05:32,968 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:32,968 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:32,968 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 09:05:32,969 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 13 [2020-09-25 09:05:32,969 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-09-25 09:05:32,969 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:33,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:05:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:33,040 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:33,054 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:33,055 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:05:33,055 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:33,055 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-09-25 09:05:33,055 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:33,056 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:33,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 09:05:33,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:33,056 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 9 [2020-09-25 09:05:33,057 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:33,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 09:05:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:33,108 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:33,265 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:33,265 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 87 [2020-09-25 09:05:33,266 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:33,266 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 172 [2020-09-25 09:05:33,266 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:33,266 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:33,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 09:05:33,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 09:05:33,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 86 [2020-09-25 09:05:33,267 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 09:05:33,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190205856] [2020-09-25 09:05:33,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 09:05:33,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-25 09:05:33,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247210595] [2020-09-25 09:05:33,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-25 09:05:33,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:05:33,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-25 09:05:33,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-25 09:05:33,363 INFO L87 Difference]: Start difference. First operand 1323 states and 1703 transitions. Second operand 8 states. [2020-09-25 09:05:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:05:35,993 INFO L93 Difference]: Finished difference Result 4217 states and 5835 transitions. [2020-09-25 09:05:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-25 09:05:35,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 120 [2020-09-25 09:05:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:05:36,018 INFO L225 Difference]: With dead ends: 4217 [2020-09-25 09:05:36,019 INFO L226 Difference]: Without dead ends: 3059 [2020-09-25 09:05:36,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-09-25 09:05:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2020-09-25 09:05:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2725. [2020-09-25 09:05:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2725 states. [2020-09-25 09:05:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 3523 transitions. [2020-09-25 09:05:36,153 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 3523 transitions. Word has length 120 [2020-09-25 09:05:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:05:36,154 INFO L479 AbstractCegarLoop]: Abstraction has 2725 states and 3523 transitions. [2020-09-25 09:05:36,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-25 09:05:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 3523 transitions. [2020-09-25 09:05:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-25 09:05:36,167 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:05:36,167 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-25 09:05:36,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-25 09:05:36,168 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:05:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:05:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2145286015, now seen corresponding path program 1 times [2020-09-25 09:05:36,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:05:36,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1977193873] [2020-09-25 09:05:36,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:05:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:36,281 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:36,487 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:36,570 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:36,707 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:37,031 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:38,501 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:41,227 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:41,227 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 233 [2020-09-25 09:05:41,227 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 6 [2020-09-25 09:05:41,228 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5001 [2020-09-25 09:05:41,228 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:41,228 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:41,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 09:05:41,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 106 [2020-09-25 09:05:41,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 104 [2020-09-25 09:05:41,229 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:41,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:05:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:41,297 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:41,305 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:41,305 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:05:41,306 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:41,306 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-09-25 09:05:41,306 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:41,306 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:41,306 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 09:05:41,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:41,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 09:05:41,307 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 09:05:41,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 09:05:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:41,351 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:41,418 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:41,418 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 09:05:41,418 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:41,419 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 80 [2020-09-25 09:05:41,419 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:41,422 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:41,422 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 09:05:41,422 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:41,423 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-09-25 09:05:41,423 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-09-25 09:05:41,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-25 09:05:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:41,493 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:41,621 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:41,621 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 98 [2020-09-25 09:05:41,621 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:41,621 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 143 [2020-09-25 09:05:41,622 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:41,622 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:41,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 09:05:41,622 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 09:05:41,623 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-09-25 09:05:41,623 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-25 09:05:41,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1977193873] [2020-09-25 09:05:41,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 09:05:41,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-25 09:05:41,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574810254] [2020-09-25 09:05:41,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 09:05:41,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:05:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 09:05:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-25 09:05:41,757 INFO L87 Difference]: Start difference. First operand 2725 states and 3523 transitions. Second operand 7 states. [2020-09-25 09:05:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:05:44,310 INFO L93 Difference]: Finished difference Result 5831 states and 7749 transitions. [2020-09-25 09:05:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-25 09:05:44,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2020-09-25 09:05:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:05:44,336 INFO L225 Difference]: With dead ends: 5831 [2020-09-25 09:05:44,336 INFO L226 Difference]: Without dead ends: 2447 [2020-09-25 09:05:44,348 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-25 09:05:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2020-09-25 09:05:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2365. [2020-09-25 09:05:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2020-09-25 09:05:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 2869 transitions. [2020-09-25 09:05:44,429 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 2869 transitions. Word has length 220 [2020-09-25 09:05:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:05:44,430 INFO L479 AbstractCegarLoop]: Abstraction has 2365 states and 2869 transitions. [2020-09-25 09:05:44,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 09:05:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2869 transitions. [2020-09-25 09:05:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-09-25 09:05:44,437 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:05:44,438 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-25 09:05:44,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-25 09:05:44,438 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:05:44,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:05:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1265665838, now seen corresponding path program 1 times [2020-09-25 09:05:44,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:05:44,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1647535431] [2020-09-25 09:05:44,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:05:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:44,566 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:44,986 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:45,234 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:46,172 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:46,173 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 299 [2020-09-25 09:05:46,173 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 09:05:46,173 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1667 [2020-09-25 09:05:46,173 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:46,173 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:46,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 09:05:46,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 163 [2020-09-25 09:05:46,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 135 [2020-09-25 09:05:46,174 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 09:05:46,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:05:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:46,258 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:46,264 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:46,265 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:05:46,265 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:46,265 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-25 09:05:46,265 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:46,266 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:46,266 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 09:05:46,266 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:46,266 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 09:05:46,266 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 09:05:46,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 09:05:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:46,352 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:46,439 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:46,440 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-09-25 09:05:46,440 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:46,440 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 114 [2020-09-25 09:05:46,440 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:46,441 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:46,441 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 09:05:46,441 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:46,441 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 134 [2020-09-25 09:05:46,442 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:46,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-09-25 09:05:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:46,537 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:46,617 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:46,711 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:46,711 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-09-25 09:05:46,712 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-25 09:05:46,712 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 192 [2020-09-25 09:05:46,712 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:46,712 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:46,712 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 09:05:46,713 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 09:05:46,713 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 106 [2020-09-25 09:05:46,713 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 114 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-25 09:05:46,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1647535431] [2020-09-25 09:05:46,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 09:05:46,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-25 09:05:46,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312471639] [2020-09-25 09:05:46,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 09:05:46,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:05:46,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 09:05:46,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-09-25 09:05:46,934 INFO L87 Difference]: Start difference. First operand 2365 states and 2869 transitions. Second operand 7 states. [2020-09-25 09:05:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:05:49,185 INFO L93 Difference]: Finished difference Result 4438 states and 5434 transitions. [2020-09-25 09:05:49,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-25 09:05:49,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 286 [2020-09-25 09:05:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:05:49,202 INFO L225 Difference]: With dead ends: 4438 [2020-09-25 09:05:49,202 INFO L226 Difference]: Without dead ends: 2238 [2020-09-25 09:05:49,210 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-09-25 09:05:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2020-09-25 09:05:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 1904. [2020-09-25 09:05:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2020-09-25 09:05:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2124 transitions. [2020-09-25 09:05:49,267 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2124 transitions. Word has length 286 [2020-09-25 09:05:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:05:49,268 INFO L479 AbstractCegarLoop]: Abstraction has 1904 states and 2124 transitions. [2020-09-25 09:05:49,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 09:05:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2124 transitions. [2020-09-25 09:05:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2020-09-25 09:05:49,275 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:05:49,275 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 09:05:49,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-25 09:05:49,276 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:05:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:05:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash -711589098, now seen corresponding path program 1 times [2020-09-25 09:05:49,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:05:49,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1777335698] [2020-09-25 09:05:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:05:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:49,419 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:50,061 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:50,061 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 317 [2020-09-25 09:05:50,062 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:50,062 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 694 [2020-09-25 09:05:50,062 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:50,062 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:50,062 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 09:05:50,062 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 294 [2020-09-25 09:05:50,063 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-09-25 09:05:50,063 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 09:05:50,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 09:05:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:50,151 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:50,158 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:50,158 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 09:05:50,159 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:50,159 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-09-25 09:05:50,159 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:50,159 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:50,159 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 09:05:50,160 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:50,160 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 09:05:50,160 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 09:05:50,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 09:05:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:50,191 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:50,211 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:50,211 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-09-25 09:05:50,212 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:50,212 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 25 [2020-09-25 09:05:50,212 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:50,212 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:50,212 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 09:05:50,213 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:50,213 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 09:05:50,213 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:50,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-09-25 09:05:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 09:05:50,299 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 09:05:50,383 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 09:05:50,383 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 147 [2020-09-25 09:05:50,383 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 09:05:50,383 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 110 [2020-09-25 09:05:50,384 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 09:05:50,384 FATAL L256 erpolLogProxyWrapper]: Tolerance: 1.0 [2020-09-25 09:05:50,384 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 09:05:50,384 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 09:05:50,384 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-09-25 09:05:50,385 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 09:05:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-09-25 09:05:50,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1777335698] [2020-09-25 09:05:50,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 09:05:50,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 09:05:50,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723686884] [2020-09-25 09:05:50,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 09:05:50,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 09:05:50,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 09:05:50,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 09:05:50,480 INFO L87 Difference]: Start difference. First operand 1904 states and 2124 transitions. Second operand 5 states. [2020-09-25 09:05:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 09:05:52,108 INFO L93 Difference]: Finished difference Result 2060 states and 2281 transitions. [2020-09-25 09:05:52,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 09:05:52,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 304 [2020-09-25 09:05:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 09:05:52,117 INFO L225 Difference]: With dead ends: 2060 [2020-09-25 09:05:52,117 INFO L226 Difference]: Without dead ends: 1898 [2020-09-25 09:05:52,118 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-09-25 09:05:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-09-25 09:05:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1894. [2020-09-25 09:05:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2020-09-25 09:05:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2105 transitions. [2020-09-25 09:05:52,162 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2105 transitions. Word has length 304 [2020-09-25 09:05:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 09:05:52,163 INFO L479 AbstractCegarLoop]: Abstraction has 1894 states and 2105 transitions. [2020-09-25 09:05:52,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 09:05:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2105 transitions. [2020-09-25 09:05:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2020-09-25 09:05:52,173 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 09:05:52,173 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-25 09:05:52,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-25 09:05:52,174 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 09:05:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 09:05:52,174 INFO L82 PathProgramCache]: Analyzing trace with hash 460101446, now seen corresponding path program 1 times [2020-09-25 09:05:52,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 09:05:52,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [37107869] [2020-09-25 09:05:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 09:05:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-25 09:05:52,310 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-25 09:05:52,311 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-25 09:05:52,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-25 09:05:52,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 09:05:52 BoogieIcfgContainer [2020-09-25 09:05:52,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-25 09:05:52,382 INFO L168 Benchmark]: Toolchain (without parser) took 37946.38 ms. Allocated memory was 146.8 MB in the beginning and 674.8 MB in the end (delta: 528.0 MB). Free memory was 100.3 MB in the beginning and 618.7 MB in the end (delta: -518.4 MB). Peak memory consumption was 489.2 MB. Max. memory is 7.1 GB. [2020-09-25 09:05:52,383 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 146.8 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-09-25 09:05:52,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.51 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 168.9 MB in the end (delta: -69.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2020-09-25 09:05:52,385 INFO L168 Benchmark]: Boogie Preprocessor took 151.52 ms. Allocated memory is still 204.5 MB. Free memory was 168.9 MB in the beginning and 164.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-09-25 09:05:52,386 INFO L168 Benchmark]: RCFGBuilder took 1565.39 ms. Allocated memory was 204.5 MB in the beginning and 238.0 MB in the end (delta: 33.6 MB). Free memory was 164.2 MB in the beginning and 161.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. [2020-09-25 09:05:52,387 INFO L168 Benchmark]: TraceAbstraction took 35339.91 ms. Allocated memory was 238.0 MB in the beginning and 674.8 MB in the end (delta: 436.7 MB). Free memory was 161.6 MB in the beginning and 618.7 MB in the end (delta: -457.2 MB). Peak memory consumption was 459.2 MB. Max. memory is 7.1 GB. [2020-09-25 09:05:52,391 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.54 ms. Allocated memory is still 146.8 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 879.51 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 168.9 MB in the end (delta: -69.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.52 ms. Allocated memory is still 204.5 MB. Free memory was 168.9 MB in the beginning and 164.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1565.39 ms. Allocated memory was 204.5 MB in the beginning and 238.0 MB in the end (delta: 33.6 MB). Free memory was 164.2 MB in the beginning and 161.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35339.91 ms. Allocated memory was 238.0 MB in the beginning and 674.8 MB in the end (delta: 436.7 MB). Free memory was 161.6 MB in the beginning and 618.7 MB in the end (delta: -457.2 MB). Peak memory consumption was 459.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 34]: 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 FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND TRUE (((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)) [L482] a1 = ((((a1 * 10)/ -9) * 5) - 333686) [L483] a10 = 4 [L484] a19 = 6 [L486] 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 TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)) [L34] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.1s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1397 SDtfs, 5695 SDslu, 1883 SDs, 0 SdLazy, 8588 SolverSat, 1212 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2725occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 846 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 1567 NumberOfCodeBlocks, 1567 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1178 ConstructedInterpolants, 0 QuantifiedInterpolants, 638466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 416/431 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...