/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SingleStatement --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-24 15:02:17,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 15:02:17,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 15:02:17,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 15:02:17,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 15:02:17,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 15:02:17,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 15:02:17,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 15:02:17,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 15:02:17,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 15:02:17,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 15:02:17,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 15:02:17,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 15:02:17,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 15:02:17,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 15:02:17,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 15:02:17,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 15:02:17,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 15:02:17,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 15:02:17,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 15:02:17,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 15:02:17,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 15:02:17,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 15:02:17,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 15:02:17,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 15:02:17,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 15:02:17,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 15:02:17,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 15:02:17,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 15:02:17,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 15:02:17,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 15:02:17,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 15:02:17,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 15:02:17,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 15:02:17,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 15:02:17,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 15:02:17,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 15:02:17,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 15:02:17,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 15:02:17,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 15:02:17,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 15:02:17,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-24 15:02:17,585 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 15:02:17,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 15:02:17,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 15:02:17,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 15:02:17,588 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 15:02:17,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 15:02:17,588 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 15:02:17,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 15:02:17,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 15:02:17,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 15:02:17,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 15:02:17,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 15:02:17,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 15:02:17,591 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 15:02:17,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 15:02:17,592 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 15:02:17,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 15:02:17,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 15:02:17,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 15:02:17,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 15:02:17,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 15:02:17,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 15:02:17,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 15:02:17,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 15:02:17,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 15:02:17,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 15:02:17,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 15:02:17,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 15:02:17,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 15:02:17,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-24 15:02:18,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 15:02:18,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 15:02:18,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 15:02:18,116 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 15:02:18,116 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 15:02:18,118 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2020-09-24 15:02:18,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6b44c1f40/c0b34d8322e34cdd89cfc2cadcf1ff22/FLAG7ac2236a4 [2020-09-24 15:02:18,907 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 15:02:18,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem02_label50.c [2020-09-24 15:02:18,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6b44c1f40/c0b34d8322e34cdd89cfc2cadcf1ff22/FLAG7ac2236a4 [2020-09-24 15:02:19,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6b44c1f40/c0b34d8322e34cdd89cfc2cadcf1ff22 [2020-09-24 15:02:19,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 15:02:19,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 15:02:19,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 15:02:19,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 15:02:19,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 15:02:19,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:02:19" (1/1) ... [2020-09-24 15:02:19,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3751f5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19, skipping insertion in model container [2020-09-24 15:02:19,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:02:19" (1/1) ... [2020-09-24 15:02:19,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 15:02:19,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 15:02:19,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:02:19,698 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 15:02:19,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:02:19,976 INFO L208 MainTranslator]: Completed translation [2020-09-24 15:02:19,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19 WrapperNode [2020-09-24 15:02:19,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 15:02:19,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 15:02:19,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 15:02:19,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 15:02:19,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19" (1/1) ... [2020-09-24 15:02:20,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19" (1/1) ... [2020-09-24 15:02:20,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19" (1/1) ... [2020-09-24 15:02:20,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19" (1/1) ... [2020-09-24 15:02:20,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19" (1/1) ... [2020-09-24 15:02:20,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19" (1/1) ... [2020-09-24 15:02:20,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19" (1/1) ... [2020-09-24 15:02:20,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 15:02:20,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 15:02:20,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 15:02:20,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 15:02:20,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 15:02:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 15:02:20,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 15:02:20,261 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 15:02:20,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 15:02:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 15:02:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 15:02:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 15:02:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 15:02:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 15:02:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 15:02:20,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 15:02:22,047 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 15:02:22,047 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 15:02:22,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:02:22 BoogieIcfgContainer [2020-09-24 15:02:22,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 15:02:22,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 15:02:22,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 15:02:22,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 15:02:22,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 03:02:19" (1/3) ... [2020-09-24 15:02:22,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65284081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:02:22, skipping insertion in model container [2020-09-24 15:02:22,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:19" (2/3) ... [2020-09-24 15:02:22,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65284081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:02:22, skipping insertion in model container [2020-09-24 15:02:22,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:02:22" (3/3) ... [2020-09-24 15:02:22,067 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label50.c [2020-09-24 15:02:22,078 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 15:02:22,090 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 15:02:22,112 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 15:02:22,147 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 15:02:22,147 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 15:02:22,148 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 15:02:22,148 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 15:02:22,148 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 15:02:22,148 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 15:02:22,148 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 15:02:22,148 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 15:02:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states. [2020-09-24 15:02:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-09-24 15:02:22,200 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:22,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:22,203 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:22,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash -593885342, now seen corresponding path program 1 times [2020-09-24 15:02:22,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:22,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [318145730] [2020-09-24 15:02:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:22,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:02:22,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [318145730] [2020-09-24 15:02:22,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:02:22,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-24 15:02:22,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883953612] [2020-09-24 15:02:22,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:02:22,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:22,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:02:22,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:02:22,857 INFO L87 Difference]: Start difference. First operand 527 states. Second operand 5 states. [2020-09-24 15:02:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:25,817 INFO L93 Difference]: Finished difference Result 1539 states and 2132 transitions. [2020-09-24 15:02:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-24 15:02:25,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2020-09-24 15:02:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:25,846 INFO L225 Difference]: With dead ends: 1539 [2020-09-24 15:02:25,846 INFO L226 Difference]: Without dead ends: 935 [2020-09-24 15:02:25,859 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:02:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-09-24 15:02:25,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 878. [2020-09-24 15:02:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-09-24 15:02:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1089 transitions. [2020-09-24 15:02:25,980 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1089 transitions. Word has length 107 [2020-09-24 15:02:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:25,981 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1089 transitions. [2020-09-24 15:02:25,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:02:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1089 transitions. [2020-09-24 15:02:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-09-24 15:02:25,996 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:25,996 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:25,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 15:02:26,000 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:26,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1658093710, now seen corresponding path program 1 times [2020-09-24 15:02:26,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:26,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [684699639] [2020-09-24 15:02:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:26,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:26,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:02:26,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [684699639] [2020-09-24 15:02:26,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:26,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 15:02:26,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855874896] [2020-09-24 15:02:26,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:02:26,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:02:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:02:26,307 INFO L87 Difference]: Start difference. First operand 878 states and 1089 transitions. Second operand 5 states. [2020-09-24 15:02:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:28,158 INFO L93 Difference]: Finished difference Result 2199 states and 2857 transitions. [2020-09-24 15:02:28,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 15:02:28,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2020-09-24 15:02:28,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:28,170 INFO L225 Difference]: With dead ends: 2199 [2020-09-24 15:02:28,171 INFO L226 Difference]: Without dead ends: 1343 [2020-09-24 15:02:28,175 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-09-24 15:02:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-09-24 15:02:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1330. [2020-09-24 15:02:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-09-24 15:02:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1680 transitions. [2020-09-24 15:02:28,228 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1680 transitions. Word has length 125 [2020-09-24 15:02:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:28,229 INFO L479 AbstractCegarLoop]: Abstraction has 1330 states and 1680 transitions. [2020-09-24 15:02:28,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:02:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1680 transitions. [2020-09-24 15:02:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-09-24 15:02:28,235 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:28,235 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:28,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 15:02:28,236 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash -125182521, now seen corresponding path program 1 times [2020-09-24 15:02:28,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:28,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [202026416] [2020-09-24 15:02:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:28,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:28,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:02:28,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [202026416] [2020-09-24 15:02:28,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:02:28,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-24 15:02:28,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674362832] [2020-09-24 15:02:28,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:02:28,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:28,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:02:28,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:02:28,451 INFO L87 Difference]: Start difference. First operand 1330 states and 1680 transitions. Second operand 8 states. [2020-09-24 15:02:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:31,516 INFO L93 Difference]: Finished difference Result 4875 states and 6618 transitions. [2020-09-24 15:02:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-24 15:02:31,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 141 [2020-09-24 15:02:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:31,545 INFO L225 Difference]: With dead ends: 4875 [2020-09-24 15:02:31,545 INFO L226 Difference]: Without dead ends: 3567 [2020-09-24 15:02:31,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-09-24 15:02:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2020-09-24 15:02:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3238. [2020-09-24 15:02:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3238 states. [2020-09-24 15:02:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4258 transitions. [2020-09-24 15:02:31,690 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4258 transitions. Word has length 141 [2020-09-24 15:02:31,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:31,691 INFO L479 AbstractCegarLoop]: Abstraction has 3238 states and 4258 transitions. [2020-09-24 15:02:31,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:02:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4258 transitions. [2020-09-24 15:02:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-24 15:02:31,701 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:31,702 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:31,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 15:02:31,702 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:31,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1712229635, now seen corresponding path program 1 times [2020-09-24 15:02:31,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:31,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [682907603] [2020-09-24 15:02:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:31,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:31,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:02:32,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [682907603] [2020-09-24 15:02:32,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:02:32,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-24 15:02:32,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421384303] [2020-09-24 15:02:32,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:02:32,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:02:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:02:32,023 INFO L87 Difference]: Start difference. First operand 3238 states and 4258 transitions. Second operand 8 states. [2020-09-24 15:02:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:35,546 INFO L93 Difference]: Finished difference Result 9599 states and 13036 transitions. [2020-09-24 15:02:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-24 15:02:35,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2020-09-24 15:02:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:35,581 INFO L225 Difference]: With dead ends: 9599 [2020-09-24 15:02:35,582 INFO L226 Difference]: Without dead ends: 6383 [2020-09-24 15:02:35,597 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-09-24 15:02:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2020-09-24 15:02:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 6006. [2020-09-24 15:02:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6006 states. [2020-09-24 15:02:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6006 states to 6006 states and 7513 transitions. [2020-09-24 15:02:35,795 INFO L78 Accepts]: Start accepts. Automaton has 6006 states and 7513 transitions. Word has length 145 [2020-09-24 15:02:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:35,795 INFO L479 AbstractCegarLoop]: Abstraction has 6006 states and 7513 transitions. [2020-09-24 15:02:35,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:02:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 6006 states and 7513 transitions. [2020-09-24 15:02:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-24 15:02:35,816 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:35,817 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:35,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 15:02:35,818 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1198067493, now seen corresponding path program 1 times [2020-09-24 15:02:35,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:35,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1967202949] [2020-09-24 15:02:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:36,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:36,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:36,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-09-24 15:02:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 33 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-24 15:02:36,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1967202949] [2020-09-24 15:02:36,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:36,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:02:36,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285957864] [2020-09-24 15:02:36,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:02:36,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:36,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:02:36,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:02:36,209 INFO L87 Difference]: Start difference. First operand 6006 states and 7513 transitions. Second operand 8 states. [2020-09-24 15:02:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:42,161 INFO L93 Difference]: Finished difference Result 16153 states and 20487 transitions. [2020-09-24 15:02:42,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-24 15:02:42,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 163 [2020-09-24 15:02:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:42,198 INFO L225 Difference]: With dead ends: 16153 [2020-09-24 15:02:42,199 INFO L226 Difference]: Without dead ends: 7939 [2020-09-24 15:02:42,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2020-09-24 15:02:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7939 states. [2020-09-24 15:02:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7939 to 6981. [2020-09-24 15:02:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6981 states. [2020-09-24 15:02:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6981 states to 6981 states and 8510 transitions. [2020-09-24 15:02:42,435 INFO L78 Accepts]: Start accepts. Automaton has 6981 states and 8510 transitions. Word has length 163 [2020-09-24 15:02:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:42,436 INFO L479 AbstractCegarLoop]: Abstraction has 6981 states and 8510 transitions. [2020-09-24 15:02:42,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:02:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6981 states and 8510 transitions. [2020-09-24 15:02:42,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-09-24 15:02:42,458 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:42,458 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:42,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-24 15:02:42,459 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:42,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash -451289247, now seen corresponding path program 1 times [2020-09-24 15:02:42,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:42,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [995698837] [2020-09-24 15:02:42,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:42,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:42,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:42,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-09-24 15:02:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 59 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:02:42,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [995698837] [2020-09-24 15:02:42,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:42,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:02:42,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592702035] [2020-09-24 15:02:42,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:02:42,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:02:42,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:02:42,701 INFO L87 Difference]: Start difference. First operand 6981 states and 8510 transitions. Second operand 7 states. [2020-09-24 15:02:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:45,387 INFO L93 Difference]: Finished difference Result 13512 states and 16431 transitions. [2020-09-24 15:02:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:02:45,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2020-09-24 15:02:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:45,417 INFO L225 Difference]: With dead ends: 13512 [2020-09-24 15:02:45,417 INFO L226 Difference]: Without dead ends: 6178 [2020-09-24 15:02:45,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-24 15:02:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2020-09-24 15:02:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 5679. [2020-09-24 15:02:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5679 states. [2020-09-24 15:02:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 6588 transitions. [2020-09-24 15:02:45,567 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 6588 transitions. Word has length 167 [2020-09-24 15:02:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:45,568 INFO L479 AbstractCegarLoop]: Abstraction has 5679 states and 6588 transitions. [2020-09-24 15:02:45,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:02:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 6588 transitions. [2020-09-24 15:02:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-09-24 15:02:45,584 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:45,585 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:45,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-24 15:02:45,585 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1664304064, now seen corresponding path program 1 times [2020-09-24 15:02:45,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:45,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976568448] [2020-09-24 15:02:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:45,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:45,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:45,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-09-24 15:02:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:45,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-24 15:02:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 85 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-24 15:02:45,936 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976568448] [2020-09-24 15:02:45,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:45,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-24 15:02:45,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268468829] [2020-09-24 15:02:45,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 15:02:45,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:45,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 15:02:45,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:02:45,939 INFO L87 Difference]: Start difference. First operand 5679 states and 6588 transitions. Second operand 9 states. [2020-09-24 15:02:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:48,302 INFO L93 Difference]: Finished difference Result 10617 states and 12302 transitions. [2020-09-24 15:02:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-24 15:02:48,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2020-09-24 15:02:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:48,334 INFO L225 Difference]: With dead ends: 10617 [2020-09-24 15:02:48,334 INFO L226 Difference]: Without dead ends: 5307 [2020-09-24 15:02:48,347 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2020-09-24 15:02:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2020-09-24 15:02:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 4205. [2020-09-24 15:02:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4205 states. [2020-09-24 15:02:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 4745 transitions. [2020-09-24 15:02:48,446 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 4745 transitions. Word has length 198 [2020-09-24 15:02:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:48,446 INFO L479 AbstractCegarLoop]: Abstraction has 4205 states and 4745 transitions. [2020-09-24 15:02:48,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 15:02:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 4745 transitions. [2020-09-24 15:02:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-09-24 15:02:48,456 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:48,456 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:48,457 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-24 15:02:48,457 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash -164510620, now seen corresponding path program 1 times [2020-09-24 15:02:48,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:48,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1948620946] [2020-09-24 15:02:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:48,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:48,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:48,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-24 15:02:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:48,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-24 15:02:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 125 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-24 15:02:48,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1948620946] [2020-09-24 15:02:48,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:48,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:02:48,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75768243] [2020-09-24 15:02:48,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:02:48,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:02:48,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:02:48,805 INFO L87 Difference]: Start difference. First operand 4205 states and 4745 transitions. Second operand 8 states. [2020-09-24 15:02:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:50,926 INFO L93 Difference]: Finished difference Result 8697 states and 9825 transitions. [2020-09-24 15:02:50,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-24 15:02:50,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 234 [2020-09-24 15:02:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:50,937 INFO L225 Difference]: With dead ends: 8697 [2020-09-24 15:02:50,938 INFO L226 Difference]: Without dead ends: 3384 [2020-09-24 15:02:50,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-09-24 15:02:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2020-09-24 15:02:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2775. [2020-09-24 15:02:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2020-09-24 15:02:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 2908 transitions. [2020-09-24 15:02:51,006 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 2908 transitions. Word has length 234 [2020-09-24 15:02:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:51,006 INFO L479 AbstractCegarLoop]: Abstraction has 2775 states and 2908 transitions. [2020-09-24 15:02:51,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:02:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 2908 transitions. [2020-09-24 15:02:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2020-09-24 15:02:51,014 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:51,014 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:51,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-24 15:02:51,015 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:51,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:51,015 INFO L82 PathProgramCache]: Analyzing trace with hash 407843693, now seen corresponding path program 1 times [2020-09-24 15:02:51,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:51,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185285653] [2020-09-24 15:02:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 15:02:51,112 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 15:02:51,112 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 15:02:51,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-24 15:02:51,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 03:02:51 BoogieIcfgContainer [2020-09-24 15:02:51,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 15:02:51,204 INFO L168 Benchmark]: Toolchain (without parser) took 32054.73 ms. Allocated memory was 139.5 MB in the beginning and 622.9 MB in the end (delta: 483.4 MB). Free memory was 100.8 MB in the beginning and 111.9 MB in the end (delta: -11.2 MB). Peak memory consumption was 472.2 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:51,206 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-24 15:02:51,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.99 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 168.7 MB in the end (delta: -68.7 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:51,208 INFO L168 Benchmark]: Boogie Preprocessor took 152.51 ms. Allocated memory is still 203.9 MB. Free memory was 168.7 MB in the beginning and 163.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:51,212 INFO L168 Benchmark]: RCFGBuilder took 1924.79 ms. Allocated memory was 203.9 MB in the beginning and 237.0 MB in the end (delta: 33.0 MB). Free memory was 163.7 MB in the beginning and 160.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:51,213 INFO L168 Benchmark]: TraceAbstraction took 29137.09 ms. Allocated memory was 237.0 MB in the beginning and 622.9 MB in the end (delta: 385.9 MB). Free memory was 158.8 MB in the beginning and 111.9 MB in the end (delta: 46.9 MB). Peak memory consumption was 432.8 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:51,224 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.49 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.99 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 168.7 MB in the end (delta: -68.7 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.51 ms. Allocated memory is still 203.9 MB. Free memory was 168.7 MB in the beginning and 163.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1924.79 ms. Allocated memory was 203.9 MB in the beginning and 237.0 MB in the end (delta: 33.0 MB). Free memory was 163.7 MB in the beginning and 160.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29137.09 ms. Allocated memory was 237.0 MB in the beginning and 622.9 MB in the end (delta: 385.9 MB). Free memory was 158.8 MB in the beginning and 111.9 MB in the end (delta: 46.9 MB). Peak memory consumption was 432.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 415]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] return 23; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L55] a28 = 7 [L56] a11 = 1 [L57] a25 = 0 [L58] return -1; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) [L415] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 527 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.9s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2436 SDtfs, 11410 SDslu, 3455 SDs, 0 SdLazy, 13385 SolverSat, 1345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6981occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 8 MinimizatonAttempts, 3944 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1556 NumberOfCodeBlocks, 1556 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1272 ConstructedInterpolants, 0 QuantifiedInterpolants, 524694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 404/456 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...