/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 false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label44.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:52:50,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:52:50,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:52:50,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:52:50,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:52:50,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:52:50,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:52:50,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:52:50,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:52:50,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:52:50,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:52:50,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:52:50,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:52:50,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:52:50,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:52:50,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:52:50,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:52:50,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:52:50,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:52:50,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:52:50,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:52:50,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:52:50,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:52:50,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:52:50,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:52:50,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:52:50,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:52:50,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:52:50,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:52:50,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:52:50,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:52:50,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:52:50,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:52:50,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:52:50,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:52:50,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:52:50,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:52:50,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:52:50,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:52:50,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:52:50,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:52: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-27 21:52:50,497 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:52:50,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:52:50,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:52:50,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:52:50,500 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:52:50,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:52:50,500 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:52:50,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:52:50,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:52:50,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:52:50,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:52:50,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:52:50,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:52:50,503 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:52:50,503 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:52:50,503 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:52:50,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:52:50,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:52:50,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:52:50,504 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:52:50,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:52:50,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:52:50,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:52:50,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:52:50,505 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:52:50,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:52:50,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:52:50,506 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:52:50,506 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:52:50,506 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 -> false [2020-08-27 21:52:50,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:52:51,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:52:51,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:52:51,022 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:52:51,023 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:52:51,024 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label44.c [2020-08-27 21:52:51,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/971d5906d/ee9b3e468c95418fb4edee2e6c7b5974/FLAG069c130cb [2020-08-27 21:52:51,781 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:52:51,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label44.c [2020-08-27 21:52:51,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/971d5906d/ee9b3e468c95418fb4edee2e6c7b5974/FLAG069c130cb [2020-08-27 21:52:52,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/971d5906d/ee9b3e468c95418fb4edee2e6c7b5974 [2020-08-27 21:52:52,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:52:52,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:52:52,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:52:52,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:52:52,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:52:52,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:52:52" (1/1) ... [2020-08-27 21:52:52,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e37eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:52, skipping insertion in model container [2020-08-27 21:52:52,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:52:52" (1/1) ... [2020-08-27 21:52:52,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:52:52,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:52:52,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:52:52,610 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:52:52,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:52:52,900 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:52:52,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:52 WrapperNode [2020-08-27 21:52:52,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:52:52,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:52:52,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:52:52,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:52:52,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:52" (1/1) ... [2020-08-27 21:52:52,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:52" (1/1) ... [2020-08-27 21:52:52,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:52" (1/1) ... [2020-08-27 21:52:52,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:52" (1/1) ... [2020-08-27 21:52:52,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:52" (1/1) ... [2020-08-27 21:52:53,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:52" (1/1) ... [2020-08-27 21:52:53,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:52" (1/1) ... [2020-08-27 21:52:53,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:52:53,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:52:53,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:52:53,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:52:53,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52: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-27 21:52:53,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:52:53,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:52:53,099 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-27 21:52:53,099 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:52:53,100 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-27 21:52:53,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:52:53,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:52:53,100 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-27 21:52:53,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:52:53,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:52:53,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:52:54,448 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:52:54,449 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-27 21:52:54,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:52:54 BoogieIcfgContainer [2020-08-27 21:52:54,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:52:54,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:52:54,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:52:54,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:52:54,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:52:52" (1/3) ... [2020-08-27 21:52:54,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4f33e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:52:54, skipping insertion in model container [2020-08-27 21:52:54,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:52:52" (2/3) ... [2020-08-27 21:52:54,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4f33e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:52:54, skipping insertion in model container [2020-08-27 21:52:54,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:52:54" (3/3) ... [2020-08-27 21:52:54,475 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label44.c [2020-08-27 21:52:54,487 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:52:54,502 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:52:54,526 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:52:54,561 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:52:54,562 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:52:54,562 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:52:54,562 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:52:54,562 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:52:54,562 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:52:54,563 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:52:54,563 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:52:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-08-27 21:52:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-27 21:52:54,604 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:52:54,606 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, 1, 1] [2020-08-27 21:52:54,606 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:52:54,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:52:54,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1855725642, now seen corresponding path program 1 times [2020-08-27 21:52:54,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:52:54,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2041557878] [2020-08-27 21:52:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:52:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:55,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:52:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:55,273 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-27 21:52:55,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2041557878] [2020-08-27 21:52:55,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:52:55,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-27 21:52:55,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56571763] [2020-08-27 21:52:55,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:52:55,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:52:55,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:52:55,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:52:55,308 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-08-27 21:52:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:52:57,763 INFO L93 Difference]: Finished difference Result 698 states and 1233 transitions. [2020-08-27 21:52:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:52:57,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2020-08-27 21:52:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:52:57,790 INFO L225 Difference]: With dead ends: 698 [2020-08-27 21:52:57,790 INFO L226 Difference]: Without dead ends: 423 [2020-08-27 21:52:57,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:52:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-08-27 21:52:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 417. [2020-08-27 21:52:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-08-27 21:52:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 585 transitions. [2020-08-27 21:52:57,948 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 585 transitions. Word has length 90 [2020-08-27 21:52:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:52:57,952 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 585 transitions. [2020-08-27 21:52:57,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:52:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 585 transitions. [2020-08-27 21:52:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-08-27 21:52:57,975 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:52:57,976 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, 1, 1] [2020-08-27 21:52:57,976 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:52:57,977 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:52:57,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:52:57,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1996722829, now seen corresponding path program 1 times [2020-08-27 21:52:57,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:52:57,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [497482447] [2020-08-27 21:52:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:52:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:58,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:52:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:58,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:52:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:52:58,264 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-27 21:52:58,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [497482447] [2020-08-27 21:52:58,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:52:58,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-27 21:52:58,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107389145] [2020-08-27 21:52:58,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:52:58,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:52:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:52:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:52:58,269 INFO L87 Difference]: Start difference. First operand 417 states and 585 transitions. Second operand 8 states. [2020-08-27 21:52:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:52:59,860 INFO L93 Difference]: Finished difference Result 1130 states and 1658 transitions. [2020-08-27 21:52:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:52:59,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2020-08-27 21:52:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:52:59,867 INFO L225 Difference]: With dead ends: 1130 [2020-08-27 21:52:59,868 INFO L226 Difference]: Without dead ends: 719 [2020-08-27 21:52:59,870 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-27 21:52:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2020-08-27 21:52:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 697. [2020-08-27 21:52:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-08-27 21:52:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 978 transitions. [2020-08-27 21:52:59,929 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 978 transitions. Word has length 100 [2020-08-27 21:52:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:52:59,929 INFO L479 AbstractCegarLoop]: Abstraction has 697 states and 978 transitions. [2020-08-27 21:52:59,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:52:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 978 transitions. [2020-08-27 21:52:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-08-27 21:52:59,936 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:52:59,937 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, 1, 1] [2020-08-27 21:52:59,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:52:59,937 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:52:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:52:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2111365455, now seen corresponding path program 1 times [2020-08-27 21:52:59,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:52:59,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1145234759] [2020-08-27 21:52:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:52:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:00,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:00,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:00,189 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-27 21:53:00,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1145234759] [2020-08-27 21:53:00,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:00,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-27 21:53:00,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067432451] [2020-08-27 21:53:00,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:53:00,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:00,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:53:00,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:53:00,192 INFO L87 Difference]: Start difference. First operand 697 states and 978 transitions. Second operand 5 states. [2020-08-27 21:53:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:01,428 INFO L93 Difference]: Finished difference Result 1944 states and 2781 transitions. [2020-08-27 21:53:01,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:53:01,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2020-08-27 21:53:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:01,442 INFO L225 Difference]: With dead ends: 1944 [2020-08-27 21:53:01,442 INFO L226 Difference]: Without dead ends: 1253 [2020-08-27 21:53:01,445 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-27 21:53:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2020-08-27 21:53:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1110. [2020-08-27 21:53:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2020-08-27 21:53:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1492 transitions. [2020-08-27 21:53:01,520 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1492 transitions. Word has length 101 [2020-08-27 21:53:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:01,521 INFO L479 AbstractCegarLoop]: Abstraction has 1110 states and 1492 transitions. [2020-08-27 21:53:01,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:53:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1492 transitions. [2020-08-27 21:53:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-08-27 21:53:01,534 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:01,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 21:53:01,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:53:01,535 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1472223214, now seen corresponding path program 1 times [2020-08-27 21:53:01,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:01,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1437403688] [2020-08-27 21:53:01,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:01,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:01,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:01,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-27 21:53:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-27 21:53:01,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1437403688] [2020-08-27 21:53:01,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:01,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:01,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938809797] [2020-08-27 21:53:01,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:01,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:01,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:01,815 INFO L87 Difference]: Start difference. First operand 1110 states and 1492 transitions. Second operand 7 states. [2020-08-27 21:53:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:03,219 INFO L93 Difference]: Finished difference Result 2677 states and 3751 transitions. [2020-08-27 21:53:03,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:53:03,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2020-08-27 21:53:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:03,238 INFO L225 Difference]: With dead ends: 2677 [2020-08-27 21:53:03,238 INFO L226 Difference]: Without dead ends: 1573 [2020-08-27 21:53:03,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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-27 21:53:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2020-08-27 21:53:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1120. [2020-08-27 21:53:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2020-08-27 21:53:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1503 transitions. [2020-08-27 21:53:03,314 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1503 transitions. Word has length 132 [2020-08-27 21:53:03,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:03,316 INFO L479 AbstractCegarLoop]: Abstraction has 1120 states and 1503 transitions. [2020-08-27 21:53:03,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1503 transitions. [2020-08-27 21:53:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-27 21:53:03,322 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:03,323 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, 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-27 21:53:03,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:53:03,323 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:03,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:03,324 INFO L82 PathProgramCache]: Analyzing trace with hash -383347850, now seen corresponding path program 1 times [2020-08-27 21:53:03,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:03,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1312060152] [2020-08-27 21:53:03,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:03,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:03,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:03,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:53:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-27 21:53:03,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1312060152] [2020-08-27 21:53:03,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:03,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:03,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008452267] [2020-08-27 21:53:03,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:03,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:03,660 INFO L87 Difference]: Start difference. First operand 1120 states and 1503 transitions. Second operand 7 states. [2020-08-27 21:53:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:05,142 INFO L93 Difference]: Finished difference Result 2687 states and 3686 transitions. [2020-08-27 21:53:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:53:05,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2020-08-27 21:53:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:05,155 INFO L225 Difference]: With dead ends: 2687 [2020-08-27 21:53:05,155 INFO L226 Difference]: Without dead ends: 1573 [2020-08-27 21:53:05,159 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:53:05,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2020-08-27 21:53:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1418. [2020-08-27 21:53:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2020-08-27 21:53:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1860 transitions. [2020-08-27 21:53:05,220 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1860 transitions. Word has length 136 [2020-08-27 21:53:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:05,221 INFO L479 AbstractCegarLoop]: Abstraction has 1418 states and 1860 transitions. [2020-08-27 21:53:05,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1860 transitions. [2020-08-27 21:53:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-08-27 21:53:05,231 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:05,231 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, 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] [2020-08-27 21:53:05,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:53:05,232 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:05,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2012786258, now seen corresponding path program 1 times [2020-08-27 21:53:05,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:05,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1158805444] [2020-08-27 21:53:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:05,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:05,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:05,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:53:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-27 21:53:05,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1158805444] [2020-08-27 21:53:05,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:05,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-27 21:53:05,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986842241] [2020-08-27 21:53:05,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:53:05,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:05,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:53:05,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:53:05,611 INFO L87 Difference]: Start difference. First operand 1418 states and 1860 transitions. Second operand 5 states. [2020-08-27 21:53:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:06,998 INFO L93 Difference]: Finished difference Result 3112 states and 4149 transitions. [2020-08-27 21:53:06,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:53:06,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2020-08-27 21:53:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:07,012 INFO L225 Difference]: With dead ends: 3112 [2020-08-27 21:53:07,012 INFO L226 Difference]: Without dead ends: 1700 [2020-08-27 21:53:07,019 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-27 21:53:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-08-27 21:53:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1696. [2020-08-27 21:53:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2020-08-27 21:53:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2210 transitions. [2020-08-27 21:53:07,096 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2210 transitions. Word has length 154 [2020-08-27 21:53:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:07,096 INFO L479 AbstractCegarLoop]: Abstraction has 1696 states and 2210 transitions. [2020-08-27 21:53:07,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:53:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2210 transitions. [2020-08-27 21:53:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-08-27 21:53:07,103 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:07,103 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 21:53:07,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:53:07,104 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:07,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:07,104 INFO L82 PathProgramCache]: Analyzing trace with hash -551051239, now seen corresponding path program 1 times [2020-08-27 21:53:07,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:07,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1225970876] [2020-08-27 21:53:07,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:07,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:07,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:07,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:53:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:07,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-27 21:53:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 83 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-27 21:53:07,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1225970876] [2020-08-27 21:53:07,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:07,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:07,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400897239] [2020-08-27 21:53:07,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:07,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:07,385 INFO L87 Difference]: Start difference. First operand 1696 states and 2210 transitions. Second operand 7 states. [2020-08-27 21:53:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:08,628 INFO L93 Difference]: Finished difference Result 3811 states and 4970 transitions. [2020-08-27 21:53:08,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:53:08,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2020-08-27 21:53:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:08,640 INFO L225 Difference]: With dead ends: 3811 [2020-08-27 21:53:08,640 INFO L226 Difference]: Without dead ends: 2121 [2020-08-27 21:53:08,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:53:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2020-08-27 21:53:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2113. [2020-08-27 21:53:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2020-08-27 21:53:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2688 transitions. [2020-08-27 21:53:08,714 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2688 transitions. Word has length 172 [2020-08-27 21:53:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:08,714 INFO L479 AbstractCegarLoop]: Abstraction has 2113 states and 2688 transitions. [2020-08-27 21:53:08,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2688 transitions. [2020-08-27 21:53:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-08-27 21:53:08,723 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:08,723 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 21:53:08,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:53:08,724 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:08,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash -370196920, now seen corresponding path program 1 times [2020-08-27 21:53:08,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:08,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1765540711] [2020-08-27 21:53:08,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:08,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:53:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:08,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-27 21:53:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:08,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-27 21:53:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:08,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-27 21:53:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:08,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-08-27 21:53:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:53:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 108 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-08-27 21:53:09,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1765540711] [2020-08-27 21:53:09,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:53:09,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:53:09,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530392297] [2020-08-27 21:53:09,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:53:09,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:53:09,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:53:09,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:53:09,015 INFO L87 Difference]: Start difference. First operand 2113 states and 2688 transitions. Second operand 7 states. [2020-08-27 21:53:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:53:10,507 INFO L93 Difference]: Finished difference Result 4111 states and 5313 transitions. [2020-08-27 21:53:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:53:10,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2020-08-27 21:53:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:53:10,519 INFO L225 Difference]: With dead ends: 4111 [2020-08-27 21:53:10,519 INFO L226 Difference]: Without dead ends: 2139 [2020-08-27 21:53:10,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 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-27 21:53:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2020-08-27 21:53:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1849. [2020-08-27 21:53:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2020-08-27 21:53:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2344 transitions. [2020-08-27 21:53:10,586 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2344 transitions. Word has length 194 [2020-08-27 21:53:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:53:10,587 INFO L479 AbstractCegarLoop]: Abstraction has 1849 states and 2344 transitions. [2020-08-27 21:53:10,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:53:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2344 transitions. [2020-08-27 21:53:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-08-27 21:53:10,593 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:53:10,594 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, 1, 1] [2020-08-27 21:53:10,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:53:10,596 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:53:10,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:53:10,597 INFO L82 PathProgramCache]: Analyzing trace with hash 162442639, now seen corresponding path program 1 times [2020-08-27 21:53:10,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:53:10,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [451364855] [2020-08-27 21:53:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:53:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-27 21:53:10,682 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-27 21:53:10,682 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-27 21:53:10,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:53:10,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:53:10 BoogieIcfgContainer [2020-08-27 21:53:10,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:53:10,737 INFO L168 Benchmark]: Toolchain (without parser) took 18709.53 ms. Allocated memory was 138.4 MB in the beginning and 442.5 MB in the end (delta: 304.1 MB). Free memory was 98.6 MB in the beginning and 156.0 MB in the end (delta: -57.5 MB). Peak memory consumption was 246.6 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:10,738 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-27 21:53:10,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.08 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 98.4 MB in the beginning and 170.0 MB in the end (delta: -71.6 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:10,740 INFO L168 Benchmark]: Boogie Preprocessor took 108.36 ms. Allocated memory is still 203.9 MB. Free memory was 170.0 MB in the beginning and 165.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:10,741 INFO L168 Benchmark]: RCFGBuilder took 1448.53 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 165.0 MB in the beginning and 180.3 MB in the end (delta: -15.3 MB). Peak memory consumption was 84.9 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:10,742 INFO L168 Benchmark]: TraceAbstraction took 16268.39 ms. Allocated memory was 234.9 MB in the beginning and 442.5 MB in the end (delta: 207.6 MB). Free memory was 178.8 MB in the beginning and 156.0 MB in the end (delta: 22.8 MB). Peak memory consumption was 230.4 MB. Max. memory is 7.1 GB. [2020-08-27 21:53:10,746 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 874.08 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 98.4 MB in the beginning and 170.0 MB in the end (delta: -71.6 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.36 ms. Allocated memory is still 203.9 MB. Free memory was 170.0 MB in the beginning and 165.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1448.53 ms. Allocated memory was 203.9 MB in the beginning and 234.9 MB in the end (delta: 30.9 MB). Free memory was 165.0 MB in the beginning and 180.3 MB in the end (delta: -15.3 MB). Peak memory consumption was 84.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16268.39 ms. Allocated memory was 234.9 MB in the beginning and 442.5 MB in the end (delta: 207.6 MB). Free memory was 178.8 MB in the beginning and 156.0 MB in the end (delta: 22.8 MB). Peak memory consumption was 230.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 428]: 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 TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L32] a16 = 5 [L33] a20 = 0 [L34] return 24; [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 TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L266] a17 = 0 [L267] return 24; [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 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 TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L313] a8 = 13 [L314] a16 = 4 [L315] 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 FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L424] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L427] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) [L428] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.1s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 200 SDtfs, 3935 SDslu, 274 SDs, 0 SdLazy, 5484 SolverSat, 1154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2113occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 1081 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1285 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1071 ConstructedInterpolants, 0 QuantifiedInterpolants, 392132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 430/471 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...