/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=0.4 --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_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-21 23:49:50,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 23:49:50,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 23:49:50,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 23:49:50,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 23:49:50,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 23:49:50,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 23:49:50,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 23:49:50,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 23:49:50,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 23:49:50,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 23:49:50,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 23:49:50,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 23:49:50,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 23:49:50,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 23:49:50,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 23:49:50,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 23:49:50,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 23:49:50,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 23:49:50,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 23:49:50,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 23:49:50,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 23:49:50,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 23:49:50,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 23:49:50,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 23:49:50,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 23:49:50,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 23:49:50,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 23:49:50,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 23:49:50,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 23:49:50,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 23:49:50,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 23:49:50,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 23:49:50,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 23:49:50,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 23:49:50,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 23:49:50,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 23:49:50,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 23:49:50,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 23:49:50,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 23:49:50,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 23:49:50,459 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-21 23:49:50,482 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 23:49:50,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 23:49:50,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 23:49:50,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 23:49:50,483 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 23:49:50,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 23:49:50,484 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 23:49:50,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 23:49:50,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 23:49:50,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 23:49:50,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 23:49:50,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 23:49:50,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 23:49:50,485 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 23:49:50,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 23:49:50,486 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 23:49:50,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 23:49:50,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 23:49:50,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 23:49:50,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 23:49:50,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 23:49:50,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 23:49:50,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 23:49:50,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 23:49:50,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 23:49:50,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 23:49:50,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 23:49:50,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 23:49:50,488 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 23:49:50,489 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=0.4;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=0.4;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=0.4;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=0.4;log-additional-information=true; [2020-08-21 23:49:50,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 23:49:50,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 23:49:50,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 23:49:50,802 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 23:49:50,802 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 23:49:50,803 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label38.c [2020-08-21 23:49:50,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/43f41497b/4d01a19e42c04dbca825d994870588ba/FLAG4fa0d6120 [2020-08-21 23:49:51,454 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 23:49:51,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label38.c [2020-08-21 23:49:51,470 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/43f41497b/4d01a19e42c04dbca825d994870588ba/FLAG4fa0d6120 [2020-08-21 23:49:51,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/43f41497b/4d01a19e42c04dbca825d994870588ba [2020-08-21 23:49:51,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 23:49:51,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 23:49:51,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 23:49:51,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 23:49:51,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 23:49:51,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:49:51" (1/1) ... [2020-08-21 23:49:51,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528baabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:51, skipping insertion in model container [2020-08-21 23:49:51,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:49:51" (1/1) ... [2020-08-21 23:49:51,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 23:49:51,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 23:49:52,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 23:49:52,185 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 23:49:52,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 23:49:52,428 INFO L208 MainTranslator]: Completed translation [2020-08-21 23:49:52,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:52 WrapperNode [2020-08-21 23:49:52,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 23:49:52,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 23:49:52,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 23:49:52,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 23:49:52,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:52" (1/1) ... [2020-08-21 23:49:52,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:52" (1/1) ... [2020-08-21 23:49:52,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:52" (1/1) ... [2020-08-21 23:49:52,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:52" (1/1) ... [2020-08-21 23:49:52,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:52" (1/1) ... [2020-08-21 23:49:52,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:52" (1/1) ... [2020-08-21 23:49:52,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:52" (1/1) ... [2020-08-21 23:49:52,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 23:49:52,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 23:49:52,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 23:49:52,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 23:49:52,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:52" (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-21 23:49:52,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 23:49:52,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 23:49:52,648 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-21 23:49:52,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 23:49:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-21 23:49:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 23:49:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 23:49:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-21 23:49:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 23:49:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 23:49:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 23:49:53,830 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 23:49:53,831 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-21 23:49:53,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:49:53 BoogieIcfgContainer [2020-08-21 23:49:53,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 23:49:53,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 23:49:53,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 23:49:53,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 23:49:53,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 11:49:51" (1/3) ... [2020-08-21 23:49:53,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b07a1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:49:53, skipping insertion in model container [2020-08-21 23:49:53,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:49:52" (2/3) ... [2020-08-21 23:49:53,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b07a1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:49:53, skipping insertion in model container [2020-08-21 23:49:53,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:49:53" (3/3) ... [2020-08-21 23:49:53,845 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label38.c [2020-08-21 23:49:53,856 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 23:49:53,864 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 23:49:53,878 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 23:49:53,904 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 23:49:53,905 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 23:49:53,905 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 23:49:53,905 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 23:49:53,906 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 23:49:53,906 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 23:49:53,906 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 23:49:53,906 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 23:49:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-08-21 23:49:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-08-21 23:49:53,941 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:49:53,942 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, 1, 1, 1] [2020-08-21 23:49:53,943 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:49:53,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:49:53,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1861146994, now seen corresponding path program 1 times [2020-08-21 23:49:53,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:49:53,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2087411231] [2020-08-21 23:49:53,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:49:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:54,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:49:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:54,495 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-21 23:49:54,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2087411231] [2020-08-21 23:49:54,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:49:54,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-21 23:49:54,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8517174] [2020-08-21 23:49:54,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 23:49:54,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:49:54,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 23:49:54,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 23:49:54,523 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-08-21 23:49:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:49:56,066 INFO L93 Difference]: Finished difference Result 557 states and 956 transitions. [2020-08-21 23:49:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 23:49:56,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-08-21 23:49:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:49:56,099 INFO L225 Difference]: With dead ends: 557 [2020-08-21 23:49:56,100 INFO L226 Difference]: Without dead ends: 286 [2020-08-21 23:49:56,111 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-21 23:49:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-08-21 23:49:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2020-08-21 23:49:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-08-21 23:49:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 402 transitions. [2020-08-21 23:49:56,216 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 402 transitions. Word has length 88 [2020-08-21 23:49:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:49:56,217 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 402 transitions. [2020-08-21 23:49:56,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 23:49:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 402 transitions. [2020-08-21 23:49:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-08-21 23:49:56,222 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:49:56,223 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, 1, 1, 1] [2020-08-21 23:49:56,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 23:49:56,223 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:49:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:49:56,224 INFO L82 PathProgramCache]: Analyzing trace with hash -136469723, now seen corresponding path program 1 times [2020-08-21 23:49:56,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:49:56,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [82544425] [2020-08-21 23:49:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:49:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:56,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:49:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:56,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:49:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:56,408 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-21 23:49:56,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [82544425] [2020-08-21 23:49:56,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:49:56,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-21 23:49:56,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375877027] [2020-08-21 23:49:56,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 23:49:56,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:49:56,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 23:49:56,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-21 23:49:56,413 INFO L87 Difference]: Start difference. First operand 280 states and 402 transitions. Second operand 8 states. [2020-08-21 23:49:57,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:49:57,947 INFO L93 Difference]: Finished difference Result 713 states and 1049 transitions. [2020-08-21 23:49:57,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 23:49:57,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2020-08-21 23:49:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:49:57,953 INFO L225 Difference]: With dead ends: 713 [2020-08-21 23:49:57,953 INFO L226 Difference]: Without dead ends: 439 [2020-08-21 23:49:57,955 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-21 23:49:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-08-21 23:49:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2020-08-21 23:49:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-08-21 23:49:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 590 transitions. [2020-08-21 23:49:57,995 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 590 transitions. Word has length 98 [2020-08-21 23:49:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:49:57,996 INFO L479 AbstractCegarLoop]: Abstraction has 421 states and 590 transitions. [2020-08-21 23:49:57,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 23:49:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 590 transitions. [2020-08-21 23:49:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-08-21 23:49:58,001 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:49:58,002 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, 1, 1, 1] [2020-08-21 23:49:58,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 23:49:58,002 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:49:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:49:58,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2049197465, now seen corresponding path program 1 times [2020-08-21 23:49:58,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:49:58,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1959054281] [2020-08-21 23:49:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:49:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:58,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:49:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:58,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:49:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:58,332 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-21 23:49:58,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1959054281] [2020-08-21 23:49:58,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:49:58,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-21 23:49:58,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931470155] [2020-08-21 23:49:58,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 23:49:58,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:49:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 23:49:58,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 23:49:58,336 INFO L87 Difference]: Start difference. First operand 421 states and 590 transitions. Second operand 5 states. [2020-08-21 23:49:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:49:59,461 INFO L93 Difference]: Finished difference Result 1257 states and 1815 transitions. [2020-08-21 23:49:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 23:49:59,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-08-21 23:49:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:49:59,480 INFO L225 Difference]: With dead ends: 1257 [2020-08-21 23:49:59,481 INFO L226 Difference]: Without dead ends: 842 [2020-08-21 23:49:59,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-21 23:49:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2020-08-21 23:49:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 836. [2020-08-21 23:49:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2020-08-21 23:49:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1170 transitions. [2020-08-21 23:49:59,545 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1170 transitions. Word has length 99 [2020-08-21 23:49:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:49:59,546 INFO L479 AbstractCegarLoop]: Abstraction has 836 states and 1170 transitions. [2020-08-21 23:49:59,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 23:49:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1170 transitions. [2020-08-21 23:49:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-08-21 23:49:59,554 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:49:59,554 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, 1, 1, 1] [2020-08-21 23:49:59,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 23:49:59,555 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:49:59,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:49:59,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1744209819, now seen corresponding path program 1 times [2020-08-21 23:49:59,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:49:59,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1830700957] [2020-08-21 23:49:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:49:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:59,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:49:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:59,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:49:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:49:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:49:59,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1830700957] [2020-08-21 23:49:59,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:49:59,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 23:49:59,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489462688] [2020-08-21 23:49:59,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 23:49:59,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:49:59,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 23:49:59,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-21 23:49:59,784 INFO L87 Difference]: Start difference. First operand 836 states and 1170 transitions. Second operand 6 states. [2020-08-21 23:50:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:50:01,011 INFO L93 Difference]: Finished difference Result 2359 states and 3419 transitions. [2020-08-21 23:50:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 23:50:01,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2020-08-21 23:50:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:50:01,021 INFO L225 Difference]: With dead ends: 2359 [2020-08-21 23:50:01,021 INFO L226 Difference]: Without dead ends: 1529 [2020-08-21 23:50:01,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-08-21 23:50:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2020-08-21 23:50:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1386. [2020-08-21 23:50:01,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2020-08-21 23:50:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1872 transitions. [2020-08-21 23:50:01,082 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1872 transitions. Word has length 105 [2020-08-21 23:50:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:50:01,082 INFO L479 AbstractCegarLoop]: Abstraction has 1386 states and 1872 transitions. [2020-08-21 23:50:01,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 23:50:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1872 transitions. [2020-08-21 23:50:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-08-21 23:50:01,088 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:50:01,088 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 23:50:01,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 23:50:01,089 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:50:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:50:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1307592906, now seen corresponding path program 1 times [2020-08-21 23:50:01,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:50:01,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [6865416] [2020-08-21 23:50:01,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:50:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:01,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:50:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:01,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:50:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:01,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 23:50:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-21 23:50:01,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [6865416] [2020-08-21 23:50:01,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:50:01,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 23:50:01,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722417535] [2020-08-21 23:50:01,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 23:50:01,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:50:01,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 23:50:01,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 23:50:01,277 INFO L87 Difference]: Start difference. First operand 1386 states and 1872 transitions. Second operand 7 states. [2020-08-21 23:50:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:50:03,474 INFO L93 Difference]: Finished difference Result 3253 states and 4635 transitions. [2020-08-21 23:50:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-21 23:50:03,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2020-08-21 23:50:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:50:03,490 INFO L225 Difference]: With dead ends: 3253 [2020-08-21 23:50:03,491 INFO L226 Difference]: Without dead ends: 1873 [2020-08-21 23:50:03,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 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-21 23:50:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2020-08-21 23:50:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1865. [2020-08-21 23:50:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1865 states. [2020-08-21 23:50:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2583 transitions. [2020-08-21 23:50:03,576 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2583 transitions. Word has length 128 [2020-08-21 23:50:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:50:03,577 INFO L479 AbstractCegarLoop]: Abstraction has 1865 states and 2583 transitions. [2020-08-21 23:50:03,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 23:50:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2583 transitions. [2020-08-21 23:50:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-08-21 23:50:03,585 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:50:03,585 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 23:50:03,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 23:50:03,586 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:50:03,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:50:03,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1735292846, now seen corresponding path program 1 times [2020-08-21 23:50:03,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:50:03,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1876919708] [2020-08-21 23:50:03,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:50:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:03,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:50:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:03,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:50:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:03,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 23:50:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-21 23:50:03,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1876919708] [2020-08-21 23:50:03,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:50:03,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-21 23:50:03,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648744915] [2020-08-21 23:50:03,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 23:50:03,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:50:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 23:50:03,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 23:50:03,763 INFO L87 Difference]: Start difference. First operand 1865 states and 2583 transitions. Second operand 5 states. [2020-08-21 23:50:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:50:05,095 INFO L93 Difference]: Finished difference Result 4012 states and 5603 transitions. [2020-08-21 23:50:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 23:50:05,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2020-08-21 23:50:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:50:05,110 INFO L225 Difference]: With dead ends: 4012 [2020-08-21 23:50:05,110 INFO L226 Difference]: Without dead ends: 2157 [2020-08-21 23:50:05,119 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-08-21 23:50:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2020-08-21 23:50:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2012. [2020-08-21 23:50:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2020-08-21 23:50:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2703 transitions. [2020-08-21 23:50:05,208 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2703 transitions. Word has length 132 [2020-08-21 23:50:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:50:05,209 INFO L479 AbstractCegarLoop]: Abstraction has 2012 states and 2703 transitions. [2020-08-21 23:50:05,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 23:50:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2703 transitions. [2020-08-21 23:50:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-08-21 23:50:05,218 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:50:05,218 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:50:05,218 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 23:50:05,218 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:50:05,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:50:05,219 INFO L82 PathProgramCache]: Analyzing trace with hash -273287469, now seen corresponding path program 1 times [2020-08-21 23:50:05,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:50:05,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433710042] [2020-08-21 23:50:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:50:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:05,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:50:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:05,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:50:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:50:05,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433710042] [2020-08-21 23:50:05,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:50:05,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-21 23:50:05,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76057625] [2020-08-21 23:50:05,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 23:50:05,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:50:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 23:50:05,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-21 23:50:05,521 INFO L87 Difference]: Start difference. First operand 2012 states and 2703 transitions. Second operand 8 states. [2020-08-21 23:50:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:50:07,264 INFO L93 Difference]: Finished difference Result 4127 states and 5429 transitions. [2020-08-21 23:50:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 23:50:07,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 141 [2020-08-21 23:50:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:50:07,291 INFO L225 Difference]: With dead ends: 4127 [2020-08-21 23:50:07,291 INFO L226 Difference]: Without dead ends: 2125 [2020-08-21 23:50:07,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-08-21 23:50:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2020-08-21 23:50:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1849. [2020-08-21 23:50:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2020-08-21 23:50:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2286 transitions. [2020-08-21 23:50:07,355 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2286 transitions. Word has length 141 [2020-08-21 23:50:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:50:07,355 INFO L479 AbstractCegarLoop]: Abstraction has 1849 states and 2286 transitions. [2020-08-21 23:50:07,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 23:50:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2286 transitions. [2020-08-21 23:50:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-08-21 23:50:07,361 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:50:07,361 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 23:50:07,362 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 23:50:07,362 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:50:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:50:07,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1409122264, now seen corresponding path program 1 times [2020-08-21 23:50:07,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:50:07,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1389162611] [2020-08-21 23:50:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:50:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:07,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:50:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:07,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:50:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:07,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-21 23:50:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-21 23:50:07,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1389162611] [2020-08-21 23:50:07,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:50:07,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 23:50:07,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143757568] [2020-08-21 23:50:07,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 23:50:07,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:50:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 23:50:07,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 23:50:07,676 INFO L87 Difference]: Start difference. First operand 1849 states and 2286 transitions. Second operand 7 states. [2020-08-21 23:50:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:50:09,145 INFO L93 Difference]: Finished difference Result 3990 states and 4952 transitions. [2020-08-21 23:50:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 23:50:09,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2020-08-21 23:50:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:50:09,160 INFO L225 Difference]: With dead ends: 3990 [2020-08-21 23:50:09,160 INFO L226 Difference]: Without dead ends: 2147 [2020-08-21 23:50:09,168 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-21 23:50:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2020-08-21 23:50:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1718. [2020-08-21 23:50:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2020-08-21 23:50:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2068 transitions. [2020-08-21 23:50:09,292 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2068 transitions. Word has length 149 [2020-08-21 23:50:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:50:09,293 INFO L479 AbstractCegarLoop]: Abstraction has 1718 states and 2068 transitions. [2020-08-21 23:50:09,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 23:50:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2068 transitions. [2020-08-21 23:50:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-08-21 23:50:09,299 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:50:09,299 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 23:50:09,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 23:50:09,300 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:50:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:50:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1345296538, now seen corresponding path program 1 times [2020-08-21 23:50:09,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:50:09,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1113162553] [2020-08-21 23:50:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:50:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:09,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:50:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:09,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:50:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:09,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 23:50:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-21 23:50:09,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1113162553] [2020-08-21 23:50:09,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:50:09,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 23:50:09,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670507670] [2020-08-21 23:50:09,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 23:50:09,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:50:09,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 23:50:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 23:50:09,587 INFO L87 Difference]: Start difference. First operand 1718 states and 2068 transitions. Second operand 7 states. [2020-08-21 23:50:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:50:10,786 INFO L93 Difference]: Finished difference Result 3458 states and 4194 transitions. [2020-08-21 23:50:10,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 23:50:10,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2020-08-21 23:50:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:50:10,794 INFO L225 Difference]: With dead ends: 3458 [2020-08-21 23:50:10,795 INFO L226 Difference]: Without dead ends: 1746 [2020-08-21 23:50:10,800 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-21 23:50:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2020-08-21 23:50:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1577. [2020-08-21 23:50:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-08-21 23:50:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 1884 transitions. [2020-08-21 23:50:10,846 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 1884 transitions. Word has length 152 [2020-08-21 23:50:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:50:10,846 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 1884 transitions. [2020-08-21 23:50:10,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 23:50:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1884 transitions. [2020-08-21 23:50:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-08-21 23:50:10,851 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:50:10,852 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 23:50:10,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 23:50:10,852 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:50:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:50:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash -82886138, now seen corresponding path program 1 times [2020-08-21 23:50:10,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:50:10,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1492978182] [2020-08-21 23:50:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:50:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:11,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:50:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:11,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:50:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:11,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-21 23:50:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-21 23:50:11,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1492978182] [2020-08-21 23:50:11,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:50:11,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 23:50:11,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518870925] [2020-08-21 23:50:11,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 23:50:11,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:50:11,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 23:50:11,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 23:50:11,175 INFO L87 Difference]: Start difference. First operand 1577 states and 1884 transitions. Second operand 7 states. [2020-08-21 23:50:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:50:12,593 INFO L93 Difference]: Finished difference Result 3446 states and 4114 transitions. [2020-08-21 23:50:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 23:50:12,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2020-08-21 23:50:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:50:12,602 INFO L225 Difference]: With dead ends: 3446 [2020-08-21 23:50:12,602 INFO L226 Difference]: Without dead ends: 1875 [2020-08-21 23:50:12,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-21 23:50:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-08-21 23:50:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1863. [2020-08-21 23:50:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1863 states. [2020-08-21 23:50:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2177 transitions. [2020-08-21 23:50:12,655 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2177 transitions. Word has length 174 [2020-08-21 23:50:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:50:12,655 INFO L479 AbstractCegarLoop]: Abstraction has 1863 states and 2177 transitions. [2020-08-21 23:50:12,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 23:50:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2177 transitions. [2020-08-21 23:50:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-08-21 23:50:12,662 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:50:12,662 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-21 23:50:12,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 23:50:12,663 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:50:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:50:12,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1827070031, now seen corresponding path program 1 times [2020-08-21 23:50:12,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:50:12,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719973491] [2020-08-21 23:50:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:50:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:12,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:50:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:12,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:50:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:12,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-21 23:50:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:12,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-08-21 23:50:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-21 23:50:13,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719973491] [2020-08-21 23:50:13,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:50:13,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 23:50:13,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91817320] [2020-08-21 23:50:13,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 23:50:13,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:50:13,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 23:50:13,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-21 23:50:13,200 INFO L87 Difference]: Start difference. First operand 1863 states and 2177 transitions. Second operand 10 states. [2020-08-21 23:50:13,862 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-08-21 23:50:14,114 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2020-08-21 23:50:14,604 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2020-08-21 23:50:15,275 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-08-21 23:50:16,503 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-08-21 23:50:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:50:17,608 INFO L93 Difference]: Finished difference Result 4540 states and 5340 transitions. [2020-08-21 23:50:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-21 23:50:17,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2020-08-21 23:50:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:50:17,619 INFO L225 Difference]: With dead ends: 4540 [2020-08-21 23:50:17,620 INFO L226 Difference]: Without dead ends: 2683 [2020-08-21 23:50:17,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2020-08-21 23:50:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2020-08-21 23:50:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2133. [2020-08-21 23:50:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2020-08-21 23:50:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2468 transitions. [2020-08-21 23:50:17,683 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2468 transitions. Word has length 199 [2020-08-21 23:50:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:50:17,684 INFO L479 AbstractCegarLoop]: Abstraction has 2133 states and 2468 transitions. [2020-08-21 23:50:17,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 23:50:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2468 transitions. [2020-08-21 23:50:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-08-21 23:50:17,691 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:50:17,691 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-08-21 23:50:17,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 23:50:17,692 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:50:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:50:17,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2033686183, now seen corresponding path program 1 times [2020-08-21 23:50:17,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:50:17,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1731197668] [2020-08-21 23:50:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:50:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:17,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:50:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:17,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 23:50:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:17,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-21 23:50:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:17,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-08-21 23:50:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:50:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 113 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-21 23:50:17,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1731197668] [2020-08-21 23:50:17,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 23:50:17,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-21 23:50:17,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658420874] [2020-08-21 23:50:17,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 23:50:17,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:50:17,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 23:50:17,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 23:50:17,944 INFO L87 Difference]: Start difference. First operand 2133 states and 2468 transitions. Second operand 5 states. [2020-08-21 23:50:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:50:19,090 INFO L93 Difference]: Finished difference Result 4816 states and 5601 transitions. [2020-08-21 23:50:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 23:50:19,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2020-08-21 23:50:19,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:50:19,100 INFO L225 Difference]: With dead ends: 4816 [2020-08-21 23:50:19,100 INFO L226 Difference]: Without dead ends: 2689 [2020-08-21 23:50:19,104 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-21 23:50:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2020-08-21 23:50:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2411. [2020-08-21 23:50:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2020-08-21 23:50:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2751 transitions. [2020-08-21 23:50:19,161 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2751 transitions. Word has length 204 [2020-08-21 23:50:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:50:19,162 INFO L479 AbstractCegarLoop]: Abstraction has 2411 states and 2751 transitions. [2020-08-21 23:50:19,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 23:50:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2751 transitions. [2020-08-21 23:50:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2020-08-21 23:50:19,169 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:50:19,170 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2020-08-21 23:50:19,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 23:50:19,170 INFO L427 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:50:19,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:50:19,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1986135978, now seen corresponding path program 1 times [2020-08-21 23:50:19,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:50:19,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [180274355] [2020-08-21 23:50:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:50:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 23:50:19,228 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 23:50:19,228 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 23:50:19,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-21 23:50:19,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 11:50:19 BoogieIcfgContainer [2020-08-21 23:50:19,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 23:50:19,297 INFO L168 Benchmark]: Toolchain (without parser) took 27588.44 ms. Allocated memory was 148.4 MB in the beginning and 549.5 MB in the end (delta: 401.1 MB). Free memory was 102.4 MB in the beginning and 428.8 MB in the end (delta: -326.3 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. [2020-08-21 23:50:19,298 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 148.4 MB. Free memory was 122.8 MB in the beginning and 122.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 23:50:19,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.54 ms. Allocated memory was 148.4 MB in the beginning and 207.1 MB in the end (delta: 58.7 MB). Free memory was 102.2 MB in the beginning and 173.4 MB in the end (delta: -71.2 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. [2020-08-21 23:50:19,299 INFO L168 Benchmark]: Boogie Preprocessor took 138.55 ms. Allocated memory is still 207.1 MB. Free memory was 173.4 MB in the beginning and 168.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2020-08-21 23:50:19,300 INFO L168 Benchmark]: RCFGBuilder took 1269.26 ms. Allocated memory was 207.1 MB in the beginning and 239.1 MB in the end (delta: 32.0 MB). Free memory was 168.0 MB in the beginning and 179.7 MB in the end (delta: -11.7 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB. [2020-08-21 23:50:19,301 INFO L168 Benchmark]: TraceAbstraction took 25457.38 ms. Allocated memory was 239.1 MB in the beginning and 549.5 MB in the end (delta: 310.4 MB). Free memory was 178.3 MB in the beginning and 428.8 MB in the end (delta: -250.5 MB). Peak memory consumption was 59.8 MB. Max. memory is 7.1 GB. [2020-08-21 23:50:19,304 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.21 ms. Allocated memory is still 148.4 MB. Free memory was 122.8 MB in the beginning and 122.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 718.54 ms. Allocated memory was 148.4 MB in the beginning and 207.1 MB in the end (delta: 58.7 MB). Free memory was 102.2 MB in the beginning and 173.4 MB in the end (delta: -71.2 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.55 ms. Allocated memory is still 207.1 MB. Free memory was 173.4 MB in the beginning and 168.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1269.26 ms. Allocated memory was 207.1 MB in the beginning and 239.1 MB in the end (delta: 32.0 MB). Free memory was 168.0 MB in the beginning and 179.7 MB in the end (delta: -11.7 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25457.38 ms. Allocated memory was 239.1 MB in the beginning and 549.5 MB in the end (delta: 310.4 MB). Free memory was 178.3 MB in the beginning and 428.8 MB in the end (delta: -250.5 MB). Peak memory consumption was 59.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 422]: 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 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 TRUE (((((((!(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)) [L279] a20 = 1 [L280] a8 = 13 [L281] a16 = 4 [L282] a7 = 0 [L283] a21 = 1 [L284] a17 = 0 [L285] 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 FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) [L422] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.3s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 5727 SDslu, 458 SDs, 0 SdLazy, 10597 SolverSat, 1610 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2411occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 2040 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1937 NumberOfCodeBlocks, 1937 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1657 ConstructedInterpolants, 0 QuantifiedInterpolants, 1020268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 744/763 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...