/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true -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-5644d1e-m [2020-08-18 16:18:55,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 16:18:55,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 16:18:55,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 16:18:55,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 16:18:55,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 16:18:55,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 16:18:55,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 16:18:55,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 16:18:55,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 16:18:55,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 16:18:55,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 16:18:55,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 16:18:55,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 16:18:55,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 16:18:55,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 16:18:55,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 16:18:55,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 16:18:55,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 16:18:55,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 16:18:55,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 16:18:55,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 16:18:55,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 16:18:55,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 16:18:55,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 16:18:55,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 16:18:55,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 16:18:55,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 16:18:55,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 16:18:55,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 16:18:55,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 16:18:55,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 16:18:55,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 16:18:55,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 16:18:55,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 16:18:55,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 16:18:55,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 16:18:55,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 16:18:55,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 16:18:55,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 16:18:55,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 16:18:55,423 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-18 16:18:55,448 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 16:18:55,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 16:18:55,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 16:18:55,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 16:18:55,450 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 16:18:55,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 16:18:55,450 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 16:18:55,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 16:18:55,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 16:18:55,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 16:18:55,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 16:18:55,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 16:18:55,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 16:18:55,452 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 16:18:55,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 16:18:55,452 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 16:18:55,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 16:18:55,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 16:18:55,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 16:18:55,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 16:18:55,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 16:18:55,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 16:18:55,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 16:18:55,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 16:18:55,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 16:18:55,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 16:18:55,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 16:18:55,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 16:18:55,455 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 16:18:55,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true [2020-08-18 16:18:55,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 16:18:55,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 16:18:55,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 16:18:55,812 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 16:18:55,812 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 16:18:55,813 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-18 16:18:55,882 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e063687c/656a688b4a4c44eb9ce2304951c8c8b9/FLAGfa733d6ea [2020-08-18 16:18:56,492 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 16:18:56,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label44.c [2020-08-18 16:18:56,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e063687c/656a688b4a4c44eb9ce2304951c8c8b9/FLAGfa733d6ea [2020-08-18 16:18:56,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e063687c/656a688b4a4c44eb9ce2304951c8c8b9 [2020-08-18 16:18:56,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 16:18:56,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 16:18:56,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 16:18:56,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 16:18:56,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 16:18:56,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 04:18:56" (1/1) ... [2020-08-18 16:18:56,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d3ce57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:56, skipping insertion in model container [2020-08-18 16:18:56,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 04:18:56" (1/1) ... [2020-08-18 16:18:56,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 16:18:56,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 16:18:57,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 16:18:57,449 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 16:18:57,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 16:18:57,608 INFO L208 MainTranslator]: Completed translation [2020-08-18 16:18:57,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:57 WrapperNode [2020-08-18 16:18:57,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 16:18:57,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 16:18:57,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 16:18:57,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 16:18:57,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:57" (1/1) ... [2020-08-18 16:18:57,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:57" (1/1) ... [2020-08-18 16:18:57,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:57" (1/1) ... [2020-08-18 16:18:57,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:57" (1/1) ... [2020-08-18 16:18:57,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:57" (1/1) ... [2020-08-18 16:18:57,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:57" (1/1) ... [2020-08-18 16:18:57,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:57" (1/1) ... [2020-08-18 16:18:57,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 16:18:57,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 16:18:57,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 16:18:57,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 16:18:57,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:57" (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-18 16:18:57,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 16:18:57,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 16:18:57,808 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-18 16:18:57,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 16:18:57,808 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-18 16:18:57,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 16:18:57,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 16:18:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-18 16:18:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 16:18:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 16:18:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 16:18:59,066 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 16:18:59,067 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-18 16:18:59,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 04:18:59 BoogieIcfgContainer [2020-08-18 16:18:59,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 16:18:59,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 16:18:59,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 16:18:59,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 16:18:59,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 04:18:56" (1/3) ... [2020-08-18 16:18:59,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a317ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 04:18:59, skipping insertion in model container [2020-08-18 16:18:59,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:18:57" (2/3) ... [2020-08-18 16:18:59,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a317ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 04:18:59, skipping insertion in model container [2020-08-18 16:18:59,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 04:18:59" (3/3) ... [2020-08-18 16:18:59,082 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label44.c [2020-08-18 16:18:59,093 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 16:18:59,101 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 16:18:59,115 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 16:18:59,141 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 16:18:59,142 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 16:18:59,142 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 16:18:59,142 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 16:18:59,142 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 16:18:59,142 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 16:18:59,143 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 16:18:59,143 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 16:18:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-08-18 16:18:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-18 16:18:59,176 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 16:18:59,178 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-18 16:18:59,178 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 16:18:59,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 16:18:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1855725642, now seen corresponding path program 1 times [2020-08-18 16:18:59,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 16:18:59,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [611380336] [2020-08-18 16:18:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 16:18:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:18:59,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 16:18:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:18:59,717 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-18 16:18:59,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [611380336] [2020-08-18 16:18:59,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 16:18:59,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-08-18 16:18:59,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334854855] [2020-08-18 16:18:59,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 16:18:59,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 16:18:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 16:18:59,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 16:18:59,750 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-08-18 16:19:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 16:19:01,756 INFO L93 Difference]: Finished difference Result 698 states and 1233 transitions. [2020-08-18 16:19:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 16:19:01,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2020-08-18 16:19:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 16:19:01,779 INFO L225 Difference]: With dead ends: 698 [2020-08-18 16:19:01,779 INFO L226 Difference]: Without dead ends: 423 [2020-08-18 16:19:01,788 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-18 16:19:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-08-18 16:19:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 417. [2020-08-18 16:19:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-08-18 16:19:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 585 transitions. [2020-08-18 16:19:01,879 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 585 transitions. Word has length 90 [2020-08-18 16:19:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 16:19:01,880 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 585 transitions. [2020-08-18 16:19:01,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 16:19:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 585 transitions. [2020-08-18 16:19:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-08-18 16:19:01,888 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 16:19:01,888 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-18 16:19:01,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 16:19:01,889 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 16:19:01,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 16:19:01,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1996722829, now seen corresponding path program 1 times [2020-08-18 16:19:01,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 16:19:01,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2106741709] [2020-08-18 16:19:01,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 16:19:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:02,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 16:19:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:02,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 16:19:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:02,087 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-18 16:19:02,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2106741709] [2020-08-18 16:19:02,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 16:19:02,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-18 16:19:02,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539577470] [2020-08-18 16:19:02,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 16:19:02,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 16:19:02,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 16:19:02,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-18 16:19:02,092 INFO L87 Difference]: Start difference. First operand 417 states and 585 transitions. Second operand 8 states. [2020-08-18 16:19:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 16:19:03,627 INFO L93 Difference]: Finished difference Result 1130 states and 1658 transitions. [2020-08-18 16:19:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 16:19:03,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2020-08-18 16:19:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 16:19:03,635 INFO L225 Difference]: With dead ends: 1130 [2020-08-18 16:19:03,635 INFO L226 Difference]: Without dead ends: 719 [2020-08-18 16:19:03,637 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-18 16:19:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2020-08-18 16:19:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 697. [2020-08-18 16:19:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-08-18 16:19:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 978 transitions. [2020-08-18 16:19:03,721 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 978 transitions. Word has length 100 [2020-08-18 16:19:03,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 16:19:03,721 INFO L479 AbstractCegarLoop]: Abstraction has 697 states and 978 transitions. [2020-08-18 16:19:03,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 16:19:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 978 transitions. [2020-08-18 16:19:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-08-18 16:19:03,725 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 16:19:03,726 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-18 16:19:03,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 16:19:03,726 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 16:19:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 16:19:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2111365455, now seen corresponding path program 1 times [2020-08-18 16:19:03,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 16:19:03,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [118082254] [2020-08-18 16:19:03,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 16:19:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:03,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 16:19:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:03,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 16:19:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:03,952 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-18 16:19:03,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [118082254] [2020-08-18 16:19:03,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 16:19:03,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-18 16:19:03,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011184429] [2020-08-18 16:19:03,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 16:19:03,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 16:19:03,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 16:19:03,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 16:19:03,955 INFO L87 Difference]: Start difference. First operand 697 states and 978 transitions. Second operand 5 states. [2020-08-18 16:19:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 16:19:05,059 INFO L93 Difference]: Finished difference Result 1944 states and 2781 transitions. [2020-08-18 16:19:05,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 16:19:05,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2020-08-18 16:19:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 16:19:05,069 INFO L225 Difference]: With dead ends: 1944 [2020-08-18 16:19:05,069 INFO L226 Difference]: Without dead ends: 1253 [2020-08-18 16:19:05,072 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-18 16:19:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2020-08-18 16:19:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1110. [2020-08-18 16:19:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2020-08-18 16:19:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1492 transitions. [2020-08-18 16:19:05,120 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1492 transitions. Word has length 101 [2020-08-18 16:19:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 16:19:05,121 INFO L479 AbstractCegarLoop]: Abstraction has 1110 states and 1492 transitions. [2020-08-18 16:19:05,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 16:19:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1492 transitions. [2020-08-18 16:19:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-08-18 16:19:05,127 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 16:19:05,128 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-18 16:19:05,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 16:19:05,128 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 16:19:05,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 16:19:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1472223214, now seen corresponding path program 1 times [2020-08-18 16:19:05,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 16:19:05,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1096062615] [2020-08-18 16:19:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 16:19:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:05,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 16:19:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:05,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 16:19:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:05,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-18 16:19:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:05,327 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-18 16:19:05,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1096062615] [2020-08-18 16:19:05,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 16:19:05,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 16:19:05,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634363043] [2020-08-18 16:19:05,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 16:19:05,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 16:19:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 16:19:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 16:19:05,330 INFO L87 Difference]: Start difference. First operand 1110 states and 1492 transitions. Second operand 7 states. [2020-08-18 16:19:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 16:19:06,551 INFO L93 Difference]: Finished difference Result 2677 states and 3751 transitions. [2020-08-18 16:19:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 16:19:06,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2020-08-18 16:19:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 16:19:06,567 INFO L225 Difference]: With dead ends: 2677 [2020-08-18 16:19:06,568 INFO L226 Difference]: Without dead ends: 1573 [2020-08-18 16:19:06,572 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-18 16:19:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2020-08-18 16:19:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1120. [2020-08-18 16:19:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2020-08-18 16:19:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1503 transitions. [2020-08-18 16:19:06,643 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1503 transitions. Word has length 132 [2020-08-18 16:19:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 16:19:06,644 INFO L479 AbstractCegarLoop]: Abstraction has 1120 states and 1503 transitions. [2020-08-18 16:19:06,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 16:19:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1503 transitions. [2020-08-18 16:19:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-18 16:19:06,649 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 16:19:06,650 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-18 16:19:06,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 16:19:06,650 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 16:19:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 16:19:06,650 INFO L82 PathProgramCache]: Analyzing trace with hash -383347850, now seen corresponding path program 1 times [2020-08-18 16:19:06,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 16:19:06,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [314259666] [2020-08-18 16:19:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 16:19:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:06,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 16:19:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:06,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 16:19:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:06,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 16:19:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:06,966 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-18 16:19:06,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [314259666] [2020-08-18 16:19:06,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 16:19:06,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 16:19:06,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213593017] [2020-08-18 16:19:06,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 16:19:06,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 16:19:06,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 16:19:06,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 16:19:06,970 INFO L87 Difference]: Start difference. First operand 1120 states and 1503 transitions. Second operand 7 states. [2020-08-18 16:19:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 16:19:08,286 INFO L93 Difference]: Finished difference Result 2687 states and 3686 transitions. [2020-08-18 16:19:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 16:19:08,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2020-08-18 16:19:08,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 16:19:08,296 INFO L225 Difference]: With dead ends: 2687 [2020-08-18 16:19:08,297 INFO L226 Difference]: Without dead ends: 1573 [2020-08-18 16:19:08,300 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-18 16:19:08,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2020-08-18 16:19:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1418. [2020-08-18 16:19:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2020-08-18 16:19:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1860 transitions. [2020-08-18 16:19:08,354 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1860 transitions. Word has length 136 [2020-08-18 16:19:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 16:19:08,354 INFO L479 AbstractCegarLoop]: Abstraction has 1418 states and 1860 transitions. [2020-08-18 16:19:08,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 16:19:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1860 transitions. [2020-08-18 16:19:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-08-18 16:19:08,360 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 16:19:08,361 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-18 16:19:08,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 16:19:08,361 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 16:19:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 16:19:08,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2012786258, now seen corresponding path program 1 times [2020-08-18 16:19:08,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 16:19:08,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1765212241] [2020-08-18 16:19:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 16:19:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:08,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 16:19:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:08,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 16:19:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:08,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 16:19:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:08,582 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-18 16:19:08,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1765212241] [2020-08-18 16:19:08,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 16:19:08,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-18 16:19:08,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428407776] [2020-08-18 16:19:08,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 16:19:08,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 16:19:08,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 16:19:08,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-18 16:19:08,594 INFO L87 Difference]: Start difference. First operand 1418 states and 1860 transitions. Second operand 5 states. [2020-08-18 16:19:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 16:19:09,623 INFO L93 Difference]: Finished difference Result 3112 states and 4149 transitions. [2020-08-18 16:19:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 16:19:09,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2020-08-18 16:19:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 16:19:09,635 INFO L225 Difference]: With dead ends: 3112 [2020-08-18 16:19:09,635 INFO L226 Difference]: Without dead ends: 1700 [2020-08-18 16:19:09,639 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-18 16:19:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-08-18 16:19:09,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1696. [2020-08-18 16:19:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2020-08-18 16:19:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2210 transitions. [2020-08-18 16:19:09,694 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2210 transitions. Word has length 154 [2020-08-18 16:19:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 16:19:09,695 INFO L479 AbstractCegarLoop]: Abstraction has 1696 states and 2210 transitions. [2020-08-18 16:19:09,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 16:19:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2210 transitions. [2020-08-18 16:19:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-08-18 16:19:09,701 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 16:19:09,702 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-18 16:19:09,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 16:19:09,702 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 16:19:09,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 16:19:09,702 INFO L82 PathProgramCache]: Analyzing trace with hash -551051239, now seen corresponding path program 1 times [2020-08-18 16:19:09,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 16:19:09,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1794383682] [2020-08-18 16:19:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 16:19:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:09,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 16:19:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:09,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 16:19:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:09,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 16:19:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:09,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-18 16:19:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:09,896 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-18 16:19:09,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1794383682] [2020-08-18 16:19:09,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 16:19:09,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 16:19:09,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76907441] [2020-08-18 16:19:09,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 16:19:09,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 16:19:09,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 16:19:09,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 16:19:09,898 INFO L87 Difference]: Start difference. First operand 1696 states and 2210 transitions. Second operand 7 states. [2020-08-18 16:19:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 16:19:11,132 INFO L93 Difference]: Finished difference Result 3811 states and 4970 transitions. [2020-08-18 16:19:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-18 16:19:11,133 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2020-08-18 16:19:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 16:19:11,144 INFO L225 Difference]: With dead ends: 3811 [2020-08-18 16:19:11,144 INFO L226 Difference]: Without dead ends: 2121 [2020-08-18 16:19:11,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-08-18 16:19:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2020-08-18 16:19:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2113. [2020-08-18 16:19:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2020-08-18 16:19:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2688 transitions. [2020-08-18 16:19:11,212 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2688 transitions. Word has length 172 [2020-08-18 16:19:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 16:19:11,212 INFO L479 AbstractCegarLoop]: Abstraction has 2113 states and 2688 transitions. [2020-08-18 16:19:11,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 16:19:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2688 transitions. [2020-08-18 16:19:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-08-18 16:19:11,219 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 16:19:11,220 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-18 16:19:11,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 16:19:11,220 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 16:19:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 16:19:11,221 INFO L82 PathProgramCache]: Analyzing trace with hash -370196920, now seen corresponding path program 1 times [2020-08-18 16:19:11,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 16:19:11,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [443241367] [2020-08-18 16:19:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 16:19:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:11,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 16:19:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:11,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-18 16:19:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:11,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-18 16:19:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:11,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-18 16:19:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:11,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-08-18 16:19:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 16:19:11,447 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-18 16:19:11,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [443241367] [2020-08-18 16:19:11,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 16:19:11,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 16:19:11,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583526196] [2020-08-18 16:19:11,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 16:19:11,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 16:19:11,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 16:19:11,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 16:19:11,450 INFO L87 Difference]: Start difference. First operand 2113 states and 2688 transitions. Second operand 7 states. [2020-08-18 16:19:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 16:19:12,755 INFO L93 Difference]: Finished difference Result 4111 states and 5313 transitions. [2020-08-18 16:19:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 16:19:12,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2020-08-18 16:19:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 16:19:12,767 INFO L225 Difference]: With dead ends: 4111 [2020-08-18 16:19:12,767 INFO L226 Difference]: Without dead ends: 2139 [2020-08-18 16:19:12,772 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-18 16:19:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2020-08-18 16:19:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1849. [2020-08-18 16:19:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2020-08-18 16:19:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2344 transitions. [2020-08-18 16:19:12,829 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2344 transitions. Word has length 194 [2020-08-18 16:19:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 16:19:12,830 INFO L479 AbstractCegarLoop]: Abstraction has 1849 states and 2344 transitions. [2020-08-18 16:19:12,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 16:19:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2344 transitions. [2020-08-18 16:19:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-08-18 16:19:12,837 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 16:19:12,837 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-18 16:19:12,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 16:19:12,838 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 16:19:12,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 16:19:12,838 INFO L82 PathProgramCache]: Analyzing trace with hash 162442639, now seen corresponding path program 1 times [2020-08-18 16:19:12,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 16:19:12,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [109325399] [2020-08-18 16:19:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 16:19:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 16:19:12,883 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 16:19:12,883 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 16:19:12,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 16:19:12,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 04:19:12 BoogieIcfgContainer [2020-08-18 16:19:12,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 16:19:12,927 INFO L168 Benchmark]: Toolchain (without parser) took 16158.87 ms. Allocated memory was 136.8 MB in the beginning and 445.1 MB in the end (delta: 308.3 MB). Free memory was 97.4 MB in the beginning and 258.9 MB in the end (delta: -161.4 MB). Peak memory consumption was 146.9 MB. Max. memory is 7.1 GB. [2020-08-18 16:19:12,928 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-08-18 16:19:12,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.66 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 97.2 MB in the beginning and 167.5 MB in the end (delta: -70.3 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. [2020-08-18 16:19:12,929 INFO L168 Benchmark]: Boogie Preprocessor took 116.82 ms. Allocated memory is still 201.9 MB. Free memory was 167.5 MB in the beginning and 162.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2020-08-18 16:19:12,930 INFO L168 Benchmark]: RCFGBuilder took 1346.15 ms. Allocated memory was 201.9 MB in the beginning and 229.6 MB in the end (delta: 27.8 MB). Free memory was 162.4 MB in the beginning and 177.8 MB in the end (delta: -15.4 MB). Peak memory consumption was 87.6 MB. Max. memory is 7.1 GB. [2020-08-18 16:19:12,931 INFO L168 Benchmark]: TraceAbstraction took 13849.87 ms. Allocated memory was 229.6 MB in the beginning and 445.1 MB in the end (delta: 215.5 MB). Free memory was 176.3 MB in the beginning and 258.9 MB in the end (delta: -82.5 MB). Peak memory consumption was 132.9 MB. Max. memory is 7.1 GB. [2020-08-18 16:19:12,935 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 840.66 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 97.2 MB in the beginning and 167.5 MB in the end (delta: -70.3 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.82 ms. Allocated memory is still 201.9 MB. Free memory was 167.5 MB in the beginning and 162.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1346.15 ms. Allocated memory was 201.9 MB in the beginning and 229.6 MB in the end (delta: 27.8 MB). Free memory was 162.4 MB in the beginning and 177.8 MB in the end (delta: -15.4 MB). Peak memory consumption was 87.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13849.87 ms. Allocated memory was 229.6 MB in the beginning and 445.1 MB in the end (delta: 215.5 MB). Free memory was 176.3 MB in the beginning and 258.9 MB in the end (delta: -82.5 MB). Peak memory consumption was 132.9 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: 13.7s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 10.9s, 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, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s 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.3s SatisfiabilityAnalysisTime, 1.4s 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...