/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 --traceabstraction.use.minimal.unsat.core.enumeration 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/Problem01_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-22 02:16:15,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 02:16:15,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 02:16:15,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 02:16:15,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 02:16:15,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 02:16:15,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 02:16:15,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 02:16:15,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 02:16:15,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 02:16:15,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 02:16:15,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 02:16:15,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 02:16:15,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 02:16:15,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 02:16:15,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 02:16:15,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 02:16:15,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 02:16:15,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 02:16:15,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 02:16:15,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 02:16:15,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 02:16:15,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 02:16:15,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 02:16:15,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 02:16:15,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 02:16:15,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 02:16:15,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 02:16:15,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 02:16:15,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 02:16:15,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 02:16:15,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 02:16:15,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 02:16:15,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 02:16:15,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 02:16:15,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 02:16:15,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 02:16:15,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 02:16:15,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 02:16:15,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 02:16:15,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 02:16:15,842 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-08-22 02:16:15,880 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 02:16:15,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 02:16:15,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 02:16:15,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 02:16:15,882 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 02:16:15,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 02:16:15,883 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 02:16:15,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 02:16:15,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 02:16:15,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 02:16:15,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 02:16:15,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 02:16:15,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 02:16:15,885 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 02:16:15,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 02:16:15,885 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 02:16:15,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 02:16:15,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 02:16:15,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 02:16:15,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 02:16:15,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 02:16:15,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 02:16:15,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 02:16:15,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 02:16:15,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 02:16:15,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 02:16:15,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 02:16:15,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 02:16:15,888 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 02:16:15,889 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.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> 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 -> 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 -> 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 -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; [2020-08-22 02:16:16,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 02:16:16,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 02:16:16,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 02:16:16,194 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 02:16:16,194 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 02:16:16,195 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label50.c [2020-08-22 02:16:16,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1f3f78fe/b7395e3eec384332927ee7f9dfa3edf8/FLAG704b48786 [2020-08-22 02:16:16,839 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 02:16:16,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label50.c [2020-08-22 02:16:16,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1f3f78fe/b7395e3eec384332927ee7f9dfa3edf8/FLAG704b48786 [2020-08-22 02:16:17,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1f3f78fe/b7395e3eec384332927ee7f9dfa3edf8 [2020-08-22 02:16:17,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 02:16:17,132 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 02:16:17,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 02:16:17,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 02:16:17,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 02:16:17,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 02:16:17" (1/1) ... [2020-08-22 02:16:17,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9c66bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17, skipping insertion in model container [2020-08-22 02:16:17,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 02:16:17" (1/1) ... [2020-08-22 02:16:17,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 02:16:17,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 02:16:17,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 02:16:17,728 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 02:16:17,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 02:16:17,876 INFO L208 MainTranslator]: Completed translation [2020-08-22 02:16:17,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17 WrapperNode [2020-08-22 02:16:17,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 02:16:17,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 02:16:17,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 02:16:17,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 02:16:17,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17" (1/1) ... [2020-08-22 02:16:17,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17" (1/1) ... [2020-08-22 02:16:17,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17" (1/1) ... [2020-08-22 02:16:17,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17" (1/1) ... [2020-08-22 02:16:17,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17" (1/1) ... [2020-08-22 02:16:17,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17" (1/1) ... [2020-08-22 02:16:17,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17" (1/1) ... [2020-08-22 02:16:17,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 02:16:17,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 02:16:17,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 02:16:17,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 02:16:17,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17" (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-08-22 02:16:18,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 02:16:18,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 02:16:18,088 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-22 02:16:18,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 02:16:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-22 02:16:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 02:16:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 02:16:18,089 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-22 02:16:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 02:16:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 02:16:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 02:16:19,305 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 02:16:19,306 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-22 02:16:19,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 02:16:19 BoogieIcfgContainer [2020-08-22 02:16:19,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 02:16:19,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 02:16:19,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 02:16:19,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 02:16:19,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 02:16:17" (1/3) ... [2020-08-22 02:16:19,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c8e14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 02:16:19, skipping insertion in model container [2020-08-22 02:16:19,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:16:17" (2/3) ... [2020-08-22 02:16:19,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c8e14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 02:16:19, skipping insertion in model container [2020-08-22 02:16:19,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 02:16:19" (3/3) ... [2020-08-22 02:16:19,332 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label50.c [2020-08-22 02:16:19,345 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 02:16:19,360 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 02:16:19,379 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 02:16:19,420 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 02:16:19,421 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 02:16:19,422 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 02:16:19,422 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 02:16:19,422 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 02:16:19,422 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 02:16:19,422 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 02:16:19,423 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 02:16:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-08-22 02:16:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-22 02:16:19,465 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:16:19,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-22 02:16:19,467 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:16:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:16:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1653547897, now seen corresponding path program 1 times [2020-08-22 02:16:19,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:16:19,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [280784644] [2020-08-22 02:16:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:16:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:20,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:16:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 02:16:20,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [280784644] [2020-08-22 02:16:20,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 02:16:20,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-22 02:16:20,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566837217] [2020-08-22 02:16:20,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 02:16:20,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:16:20,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 02:16:20,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-22 02:16:20,106 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-08-22 02:16:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:16:21,629 INFO L93 Difference]: Finished difference Result 557 states and 956 transitions. [2020-08-22 02:16:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 02:16:21,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2020-08-22 02:16:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:16:21,648 INFO L225 Difference]: With dead ends: 557 [2020-08-22 02:16:21,648 INFO L226 Difference]: Without dead ends: 286 [2020-08-22 02:16:21,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-22 02:16:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-08-22 02:16:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2020-08-22 02:16:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-08-22 02:16:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 402 transitions. [2020-08-22 02:16:21,732 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 402 transitions. Word has length 85 [2020-08-22 02:16:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:16:21,734 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 402 transitions. [2020-08-22 02:16:21,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 02:16:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 402 transitions. [2020-08-22 02:16:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-08-22 02:16:21,739 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:16:21,739 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-08-22 02:16:21,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 02:16:21,743 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:16:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:16:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2076475216, now seen corresponding path program 1 times [2020-08-22 02:16:21,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:16:21,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238161136] [2020-08-22 02:16:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:16:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:21,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:16:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:21,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 02:16:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 02:16:21,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238161136] [2020-08-22 02:16:21,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 02:16:21,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 02:16:21,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882304767] [2020-08-22 02:16:21,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 02:16:21,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:16:21,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 02:16:21,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-22 02:16:21,970 INFO L87 Difference]: Start difference. First operand 280 states and 402 transitions. Second operand 8 states. [2020-08-22 02:16:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:16:23,453 INFO L93 Difference]: Finished difference Result 713 states and 1049 transitions. [2020-08-22 02:16:23,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 02:16:23,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2020-08-22 02:16:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:16:23,458 INFO L225 Difference]: With dead ends: 713 [2020-08-22 02:16:23,459 INFO L226 Difference]: Without dead ends: 439 [2020-08-22 02:16:23,461 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-08-22 02:16:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-08-22 02:16:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2020-08-22 02:16:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-08-22 02:16:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 590 transitions. [2020-08-22 02:16:23,530 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 590 transitions. Word has length 95 [2020-08-22 02:16:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:16:23,531 INFO L479 AbstractCegarLoop]: Abstraction has 421 states and 590 transitions. [2020-08-22 02:16:23,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 02:16:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 590 transitions. [2020-08-22 02:16:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-22 02:16:23,534 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:16:23,535 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:16:23,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 02:16:23,535 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:16:23,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:16:23,536 INFO L82 PathProgramCache]: Analyzing trace with hash -970621106, now seen corresponding path program 1 times [2020-08-22 02:16:23,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:16:23,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687131242] [2020-08-22 02:16:23,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:16:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:23,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:16:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:23,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 02:16:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 02:16:23,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687131242] [2020-08-22 02:16:23,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:16:23,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-22 02:16:23,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373783671] [2020-08-22 02:16:23,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 02:16:23,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:16:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 02:16:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-22 02:16:23,761 INFO L87 Difference]: Start difference. First operand 421 states and 590 transitions. Second operand 5 states. [2020-08-22 02:16:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:16:25,001 INFO L93 Difference]: Finished difference Result 1257 states and 1810 transitions. [2020-08-22 02:16:25,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 02:16:25,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2020-08-22 02:16:25,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:16:25,011 INFO L225 Difference]: With dead ends: 1257 [2020-08-22 02:16:25,012 INFO L226 Difference]: Without dead ends: 842 [2020-08-22 02:16:25,013 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-22 02:16:25,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2020-08-22 02:16:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 699. [2020-08-22 02:16:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2020-08-22 02:16:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 935 transitions. [2020-08-22 02:16:25,066 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 935 transitions. Word has length 96 [2020-08-22 02:16:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:16:25,067 INFO L479 AbstractCegarLoop]: Abstraction has 699 states and 935 transitions. [2020-08-22 02:16:25,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 02:16:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 935 transitions. [2020-08-22 02:16:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-08-22 02:16:25,072 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:16:25,072 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:16:25,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 02:16:25,073 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:16:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:16:25,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1409491302, now seen corresponding path program 1 times [2020-08-22 02:16:25,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:16:25,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1152624575] [2020-08-22 02:16:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:16:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:25,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:16:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:25,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 02:16:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 02:16:25,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1152624575] [2020-08-22 02:16:25,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 02:16:25,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 02:16:25,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637382382] [2020-08-22 02:16:25,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 02:16:25,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:16:25,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 02:16:25,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-22 02:16:25,311 INFO L87 Difference]: Start difference. First operand 699 states and 935 transitions. Second operand 8 states. [2020-08-22 02:16:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:16:27,333 INFO L93 Difference]: Finished difference Result 1688 states and 2336 transitions. [2020-08-22 02:16:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 02:16:27,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2020-08-22 02:16:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:16:27,342 INFO L225 Difference]: With dead ends: 1688 [2020-08-22 02:16:27,343 INFO L226 Difference]: Without dead ends: 995 [2020-08-22 02:16:27,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-08-22 02:16:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2020-08-22 02:16:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 979. [2020-08-22 02:16:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2020-08-22 02:16:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1232 transitions. [2020-08-22 02:16:27,415 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1232 transitions. Word has length 102 [2020-08-22 02:16:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:16:27,418 INFO L479 AbstractCegarLoop]: Abstraction has 979 states and 1232 transitions. [2020-08-22 02:16:27,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 02:16:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1232 transitions. [2020-08-22 02:16:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-08-22 02:16:27,435 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:16:27,436 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-08-22 02:16:27,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 02:16:27,436 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:16:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:16:27,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1605942605, now seen corresponding path program 1 times [2020-08-22 02:16:27,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:16:27,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1074289282] [2020-08-22 02:16:27,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:16:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:27,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:16:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:27,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 02:16:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:27,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 02:16:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 02:16:27,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1074289282] [2020-08-22 02:16:27,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:16:27,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 02:16:27,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899298593] [2020-08-22 02:16:27,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 02:16:27,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:16:27,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 02:16:27,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 02:16:27,650 INFO L87 Difference]: Start difference. First operand 979 states and 1232 transitions. Second operand 7 states. [2020-08-22 02:16:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:16:29,013 INFO L93 Difference]: Finished difference Result 2818 states and 3681 transitions. [2020-08-22 02:16:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 02:16:29,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2020-08-22 02:16:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:16:29,029 INFO L225 Difference]: With dead ends: 2818 [2020-08-22 02:16:29,030 INFO L226 Difference]: Without dead ends: 1555 [2020-08-22 02:16:29,035 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-22 02:16:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2020-08-22 02:16:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1263. [2020-08-22 02:16:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2020-08-22 02:16:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1495 transitions. [2020-08-22 02:16:29,113 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1495 transitions. Word has length 113 [2020-08-22 02:16:29,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:16:29,114 INFO L479 AbstractCegarLoop]: Abstraction has 1263 states and 1495 transitions. [2020-08-22 02:16:29,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 02:16:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1495 transitions. [2020-08-22 02:16:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-22 02:16:29,120 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:16:29,121 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:16:29,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 02:16:29,122 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:16:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:16:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1610941859, now seen corresponding path program 1 times [2020-08-22 02:16:29,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:16:29,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075493864] [2020-08-22 02:16:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:16:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:29,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:16:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:29,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 02:16:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:29,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 02:16:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 02:16:29,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075493864] [2020-08-22 02:16:29,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:16:29,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 02:16:29,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732642707] [2020-08-22 02:16:29,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 02:16:29,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:16:29,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 02:16:29,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 02:16:29,409 INFO L87 Difference]: Start difference. First operand 1263 states and 1495 transitions. Second operand 7 states. [2020-08-22 02:16:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:16:30,633 INFO L93 Difference]: Finished difference Result 3503 states and 4276 transitions. [2020-08-22 02:16:30,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 02:16:30,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2020-08-22 02:16:30,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:16:30,648 INFO L225 Difference]: With dead ends: 3503 [2020-08-22 02:16:30,649 INFO L226 Difference]: Without dead ends: 2107 [2020-08-22 02:16:30,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-22 02:16:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2020-08-22 02:16:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1682. [2020-08-22 02:16:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-08-22 02:16:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 1967 transitions. [2020-08-22 02:16:30,720 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 1967 transitions. Word has length 121 [2020-08-22 02:16:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:16:30,721 INFO L479 AbstractCegarLoop]: Abstraction has 1682 states and 1967 transitions. [2020-08-22 02:16:30,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 02:16:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 1967 transitions. [2020-08-22 02:16:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-08-22 02:16:30,726 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:16:30,726 INFO L422 BasicCegarLoop]: trace histogram [4, 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, 2, 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] [2020-08-22 02:16:30,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 02:16:30,727 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:16:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:16:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1106544002, now seen corresponding path program 1 times [2020-08-22 02:16:30,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:16:30,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2034019000] [2020-08-22 02:16:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:16:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:30,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:16:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:30,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 02:16:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:30,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 02:16:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:30,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 02:16:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 133 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 02:16:31,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2034019000] [2020-08-22 02:16:31,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:16:31,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 02:16:31,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147418664] [2020-08-22 02:16:31,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 02:16:31,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:16:31,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 02:16:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 02:16:31,019 INFO L87 Difference]: Start difference. First operand 1682 states and 1967 transitions. Second operand 7 states. [2020-08-22 02:16:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:16:32,359 INFO L93 Difference]: Finished difference Result 3793 states and 4432 transitions. [2020-08-22 02:16:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 02:16:32,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2020-08-22 02:16:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:16:32,371 INFO L225 Difference]: With dead ends: 3793 [2020-08-22 02:16:32,371 INFO L226 Difference]: Without dead ends: 2117 [2020-08-22 02:16:32,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-22 02:16:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2020-08-22 02:16:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2115. [2020-08-22 02:16:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2020-08-22 02:16:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2391 transitions. [2020-08-22 02:16:32,436 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2391 transitions. Word has length 193 [2020-08-22 02:16:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:16:32,437 INFO L479 AbstractCegarLoop]: Abstraction has 2115 states and 2391 transitions. [2020-08-22 02:16:32,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 02:16:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2391 transitions. [2020-08-22 02:16:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-08-22 02:16:32,443 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:16:32,443 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-22 02:16:32,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 02:16:32,444 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:16:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:16:32,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1639971981, now seen corresponding path program 1 times [2020-08-22 02:16:32,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:16:32,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [341762890] [2020-08-22 02:16:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:16:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:32,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:16:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:32,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 02:16:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:32,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 02:16:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:32,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-22 02:16:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:32,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 02:16:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 29 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-08-22 02:16:32,776 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [341762890] [2020-08-22 02:16:32,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:16:32,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 02:16:32,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394581502] [2020-08-22 02:16:32,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 02:16:32,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:16:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 02:16:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-22 02:16:32,779 INFO L87 Difference]: Start difference. First operand 2115 states and 2391 transitions. Second operand 9 states. [2020-08-22 02:16:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:16:36,842 INFO L93 Difference]: Finished difference Result 6836 states and 8073 transitions. [2020-08-22 02:16:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-22 02:16:36,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2020-08-22 02:16:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:16:36,871 INFO L225 Difference]: With dead ends: 6836 [2020-08-22 02:16:36,871 INFO L226 Difference]: Without dead ends: 4862 [2020-08-22 02:16:36,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2020-08-22 02:16:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2020-08-22 02:16:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4437. [2020-08-22 02:16:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4437 states. [2020-08-22 02:16:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 5195 transitions. [2020-08-22 02:16:37,040 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 5195 transitions. Word has length 199 [2020-08-22 02:16:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:16:37,040 INFO L479 AbstractCegarLoop]: Abstraction has 4437 states and 5195 transitions. [2020-08-22 02:16:37,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 02:16:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 5195 transitions. [2020-08-22 02:16:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-08-22 02:16:37,056 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:16:37,056 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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] [2020-08-22 02:16:37,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 02:16:37,059 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:16:37,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:16:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash 512536307, now seen corresponding path program 1 times [2020-08-22 02:16:37,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:16:37,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [603560925] [2020-08-22 02:16:37,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:16:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:37,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:16:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:37,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 02:16:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:37,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 02:16:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:37,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-08-22 02:16:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:37,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-08-22 02:16:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:16:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 165 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-08-22 02:16:37,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [603560925] [2020-08-22 02:16:37,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:16:37,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 02:16:37,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967285375] [2020-08-22 02:16:37,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 02:16:37,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:16:37,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 02:16:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-08-22 02:16:37,515 INFO L87 Difference]: Start difference. First operand 4437 states and 5195 transitions. Second operand 11 states. [2020-08-22 02:16:38,875 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-08-22 02:16:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:16:41,891 INFO L93 Difference]: Finished difference Result 9293 states and 10891 transitions. [2020-08-22 02:16:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 02:16:41,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 218 [2020-08-22 02:16:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:16:41,912 INFO L225 Difference]: With dead ends: 9293 [2020-08-22 02:16:41,912 INFO L226 Difference]: Without dead ends: 4699 [2020-08-22 02:16:41,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2020-08-22 02:16:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2020-08-22 02:16:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4423. [2020-08-22 02:16:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4423 states. [2020-08-22 02:16:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 5079 transitions. [2020-08-22 02:16:42,058 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 5079 transitions. Word has length 218 [2020-08-22 02:16:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:16:42,059 INFO L479 AbstractCegarLoop]: Abstraction has 4423 states and 5079 transitions. [2020-08-22 02:16:42,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 02:16:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 5079 transitions. [2020-08-22 02:16:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2020-08-22 02:16:42,072 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:16:42,072 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2020-08-22 02:16:42,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 02:16:42,073 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:16:42,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:16:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1816850039, now seen corresponding path program 1 times [2020-08-22 02:16:42,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:16:42,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1133566353] [2020-08-22 02:16:42,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:16:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 02:16:42,145 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 02:16:42,145 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 02:16:42,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 02:16:42,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 02:16:42 BoogieIcfgContainer [2020-08-22 02:16:42,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 02:16:42,216 INFO L168 Benchmark]: Toolchain (without parser) took 25084.84 ms. Allocated memory was 140.5 MB in the beginning and 518.5 MB in the end (delta: 378.0 MB). Free memory was 99.9 MB in the beginning and 264.6 MB in the end (delta: -164.6 MB). Peak memory consumption was 213.4 MB. Max. memory is 7.1 GB. [2020-08-22 02:16:42,217 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-22 02:16:42,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.52 ms. Allocated memory was 140.5 MB in the beginning and 206.0 MB in the end (delta: 65.5 MB). Free memory was 99.7 MB in the beginning and 171.7 MB in the end (delta: -72.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2020-08-22 02:16:42,219 INFO L168 Benchmark]: Boogie Preprocessor took 108.42 ms. Allocated memory is still 206.0 MB. Free memory was 171.7 MB in the beginning and 166.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2020-08-22 02:16:42,223 INFO L168 Benchmark]: RCFGBuilder took 1333.76 ms. Allocated memory was 206.0 MB in the beginning and 237.5 MB in the end (delta: 31.5 MB). Free memory was 166.3 MB in the beginning and 176.7 MB in the end (delta: -10.4 MB). Peak memory consumption was 79.8 MB. Max. memory is 7.1 GB. [2020-08-22 02:16:42,226 INFO L168 Benchmark]: TraceAbstraction took 22891.87 ms. Allocated memory was 237.5 MB in the beginning and 518.5 MB in the end (delta: 281.0 MB). Free memory was 176.7 MB in the beginning and 264.6 MB in the end (delta: -87.9 MB). Peak memory consumption was 193.1 MB. Max. memory is 7.1 GB. [2020-08-22 02:16:42,236 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.16 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.52 ms. Allocated memory was 140.5 MB in the beginning and 206.0 MB in the end (delta: 65.5 MB). Free memory was 99.7 MB in the beginning and 171.7 MB in the end (delta: -72.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.42 ms. Allocated memory is still 206.0 MB. Free memory was 171.7 MB in the beginning and 166.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1333.76 ms. Allocated memory was 206.0 MB in the beginning and 237.5 MB in the end (delta: 31.5 MB). Free memory was 166.3 MB in the beginning and 176.7 MB in the end (delta: -10.4 MB). Peak memory consumption was 79.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22891.87 ms. Allocated memory was 237.5 MB in the beginning and 518.5 MB in the end (delta: 281.0 MB). Free memory was 176.7 MB in the beginning and 264.6 MB in the end (delta: -87.9 MB). Peak memory consumption was 193.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 413]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND TRUE ((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)) [L85] a7 = 0 [L86] a20 = 1 [L87] a8 = 14 [L88] a16 = 4 [L89] a21 = 1 [L90] a17 = 0 [L91] return -1; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) [L413] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.7s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 304 SDtfs, 6284 SDslu, 521 SDs, 0 SdLazy, 10804 SolverSat, 1520 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4437occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 1603 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1451 NumberOfCodeBlocks, 1451 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1213 ConstructedInterpolants, 0 QuantifiedInterpolants, 466227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 649/712 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...