/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label35.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:22:35,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:22:35,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:22:35,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:22:35,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:22:35,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:22:35,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:22:35,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:22:35,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:22:35,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:22:35,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:22:35,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:22:35,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:22:35,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:22:35,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:22:35,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:22:35,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:22:35,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:22:35,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:22:35,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:22:35,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:22:35,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:22:35,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:22:35,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:22:35,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:22:35,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:22:35,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:22:35,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:22:35,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:22:35,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:22:35,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:22:35,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:22:35,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:22:35,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:22:35,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:22:35,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:22:35,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:22:35,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:22:35,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:22:35,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:22:35,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:22:35,367 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-21 10:22:35,408 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:22:35,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:22:35,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:22:35,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:22:35,411 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:22:35,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:22:35,411 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:22:35,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:22:35,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:22:35,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:22:35,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:22:35,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:22:35,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:22:35,414 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:22:35,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:22:35,414 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:22:35,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:22:35,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:22:35,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:22:35,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:22:35,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:22:35,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:22:35,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:22:35,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:22:35,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:22:35,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:22:35,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:22:35,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:22:35,417 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:22:35,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:22:35,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:22:35,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:22:35,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:22:35,885 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:22:35,885 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:22:35,886 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label35.c [2020-09-21 10:22:35,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3b038c84c/bbd8f24009b54fe89e48de067735db94/FLAG866f9fec4 [2020-09-21 10:22:36,593 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:22:36,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label35.c [2020-09-21 10:22:36,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3b038c84c/bbd8f24009b54fe89e48de067735db94/FLAG866f9fec4 [2020-09-21 10:22:36,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3b038c84c/bbd8f24009b54fe89e48de067735db94 [2020-09-21 10:22:36,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:22:36,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:22:36,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:22:36,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:22:36,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:22:36,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:22:36" (1/1) ... [2020-09-21 10:22:36,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccf1036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:36, skipping insertion in model container [2020-09-21 10:22:36,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:22:36" (1/1) ... [2020-09-21 10:22:36,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:22:36,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:22:37,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:22:37,486 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:22:37,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:22:37,626 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:22:37,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:37 WrapperNode [2020-09-21 10:22:37,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:22:37,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:22:37,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:22:37,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:22:37,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:37" (1/1) ... [2020-09-21 10:22:37,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:37" (1/1) ... [2020-09-21 10:22:37,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:37" (1/1) ... [2020-09-21 10:22:37,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:37" (1/1) ... [2020-09-21 10:22:37,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:37" (1/1) ... [2020-09-21 10:22:37,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:37" (1/1) ... [2020-09-21 10:22:37,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:37" (1/1) ... [2020-09-21 10:22:37,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:22:37,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:22:37,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:22:37,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:22:37,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:37" (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-21 10:22:37,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:22:37,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:22:37,852 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-21 10:22:37,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:22:37,853 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-21 10:22:37,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:22:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:22:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-21 10:22:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:22:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:22:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:22:38,975 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:22:38,975 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 10:22:38,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:22:38 BoogieIcfgContainer [2020-09-21 10:22:38,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:22:38,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:22:38,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:22:38,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:22:38,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:22:36" (1/3) ... [2020-09-21 10:22:38,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8c9006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:22:38, skipping insertion in model container [2020-09-21 10:22:38,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:22:37" (2/3) ... [2020-09-21 10:22:38,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8c9006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:22:38, skipping insertion in model container [2020-09-21 10:22:38,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:22:38" (3/3) ... [2020-09-21 10:22:38,992 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label35.c [2020-09-21 10:22:39,004 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:22:39,014 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:22:39,036 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:22:39,068 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:22:39,069 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:22:39,069 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:22:39,069 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:22:39,069 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:22:39,069 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:22:39,070 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:22:39,070 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:22:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-09-21 10:22:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-21 10:22:39,108 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:22:39,109 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] [2020-09-21 10:22:39,110 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:22:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:22:39,117 INFO L82 PathProgramCache]: Analyzing trace with hash 279627110, now seen corresponding path program 1 times [2020-09-21 10:22:39,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:22:39,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [970088108] [2020-09-21 10:22:39,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:22:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:39,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:22:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:39,826 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-21 10:22:39,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [970088108] [2020-09-21 10:22:39,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:22:39,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 10:22:39,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610022096] [2020-09-21 10:22:39,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:22:39,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:22:39,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:22:39,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:22:39,861 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 5 states. [2020-09-21 10:22:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:22:41,872 INFO L93 Difference]: Finished difference Result 698 states and 1233 transitions. [2020-09-21 10:22:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:22:41,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2020-09-21 10:22:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:22:41,897 INFO L225 Difference]: With dead ends: 698 [2020-09-21 10:22:41,898 INFO L226 Difference]: Without dead ends: 423 [2020-09-21 10:22:41,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:22:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-09-21 10:22:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 417. [2020-09-21 10:22:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-09-21 10:22:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 585 transitions. [2020-09-21 10:22:42,004 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 585 transitions. Word has length 86 [2020-09-21 10:22:42,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:22:42,005 INFO L479 AbstractCegarLoop]: Abstraction has 417 states and 585 transitions. [2020-09-21 10:22:42,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:22:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 585 transitions. [2020-09-21 10:22:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-21 10:22:42,012 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:22:42,012 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:22:42,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:22:42,013 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:22:42,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:22:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash -53773379, now seen corresponding path program 1 times [2020-09-21 10:22:42,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:22:42,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1499366791] [2020-09-21 10:22:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:22:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:42,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:22:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:42,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:22:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:22:42,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1499366791] [2020-09-21 10:22:42,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:22:42,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 10:22:42,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007579432] [2020-09-21 10:22:42,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:22:42,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:22:42,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:22:42,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:22:42,291 INFO L87 Difference]: Start difference. First operand 417 states and 585 transitions. Second operand 8 states. [2020-09-21 10:22:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:22:43,914 INFO L93 Difference]: Finished difference Result 1130 states and 1658 transitions. [2020-09-21 10:22:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:22:43,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-09-21 10:22:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:22:43,921 INFO L225 Difference]: With dead ends: 1130 [2020-09-21 10:22:43,921 INFO L226 Difference]: Without dead ends: 719 [2020-09-21 10:22:43,923 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:22:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2020-09-21 10:22:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 697. [2020-09-21 10:22:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-09-21 10:22:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 978 transitions. [2020-09-21 10:22:43,982 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 978 transitions. Word has length 96 [2020-09-21 10:22:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:22:43,983 INFO L479 AbstractCegarLoop]: Abstraction has 697 states and 978 transitions. [2020-09-21 10:22:43,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:22:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 978 transitions. [2020-09-21 10:22:43,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-21 10:22:43,989 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:22:43,989 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:22:43,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:22:43,990 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:22:43,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:22:43,990 INFO L82 PathProgramCache]: Analyzing trace with hash -24478849, now seen corresponding path program 1 times [2020-09-21 10:22:43,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:22:43,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [273501808] [2020-09-21 10:22:43,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:22:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:44,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:22:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:44,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:22:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:22:44,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [273501808] [2020-09-21 10:22:44,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:22:44,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 10:22:44,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798556067] [2020-09-21 10:22:44,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:22:44,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:22:44,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:22:44,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:22:44,201 INFO L87 Difference]: Start difference. First operand 697 states and 978 transitions. Second operand 5 states. [2020-09-21 10:22:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:22:45,442 INFO L93 Difference]: Finished difference Result 1944 states and 2778 transitions. [2020-09-21 10:22:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:22:45,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2020-09-21 10:22:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:22:45,451 INFO L225 Difference]: With dead ends: 1944 [2020-09-21 10:22:45,451 INFO L226 Difference]: Without dead ends: 1253 [2020-09-21 10:22:45,453 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-21 10:22:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2020-09-21 10:22:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1112. [2020-09-21 10:22:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2020-09-21 10:22:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1478 transitions. [2020-09-21 10:22:45,499 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1478 transitions. Word has length 97 [2020-09-21 10:22:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:22:45,500 INFO L479 AbstractCegarLoop]: Abstraction has 1112 states and 1478 transitions. [2020-09-21 10:22:45,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:22:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1478 transitions. [2020-09-21 10:22:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-09-21 10:22:45,507 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:22:45,507 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] [2020-09-21 10:22:45,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:22:45,508 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:22:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:22:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1420356985, now seen corresponding path program 1 times [2020-09-21 10:22:45,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:22:45,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739999896] [2020-09-21 10:22:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:22:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:45,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:22:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:45,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:22:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:22:45,774 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739999896] [2020-09-21 10:22:45,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:22:45,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 10:22:45,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717213274] [2020-09-21 10:22:45,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:22:45,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:22:45,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:22:45,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:22:45,779 INFO L87 Difference]: Start difference. First operand 1112 states and 1478 transitions. Second operand 8 states. [2020-09-21 10:22:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:22:47,752 INFO L93 Difference]: Finished difference Result 2516 states and 3411 transitions. [2020-09-21 10:22:47,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:22:47,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2020-09-21 10:22:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:22:47,764 INFO L225 Difference]: With dead ends: 2516 [2020-09-21 10:22:47,764 INFO L226 Difference]: Without dead ends: 1410 [2020-09-21 10:22:47,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:22:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-09-21 10:22:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1390. [2020-09-21 10:22:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2020-09-21 10:22:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1790 transitions. [2020-09-21 10:22:47,833 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1790 transitions. Word has length 98 [2020-09-21 10:22:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:22:47,833 INFO L479 AbstractCegarLoop]: Abstraction has 1390 states and 1790 transitions. [2020-09-21 10:22:47,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:22:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1790 transitions. [2020-09-21 10:22:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-09-21 10:22:47,839 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:22:47,839 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-09-21 10:22:47,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:22:47,840 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:22:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:22:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash -579647982, now seen corresponding path program 1 times [2020-09-21 10:22:47,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:22:47,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [89374720] [2020-09-21 10:22:47,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:22:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:47,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:22:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:48,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:22:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:48,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-21 10:22:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 10:22:48,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [89374720] [2020-09-21 10:22:48,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:22:48,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:22:48,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438044661] [2020-09-21 10:22:48,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:22:48,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:22:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:22:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:22:48,069 INFO L87 Difference]: Start difference. First operand 1390 states and 1790 transitions. Second operand 7 states. [2020-09-21 10:22:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:22:50,118 INFO L93 Difference]: Finished difference Result 3598 states and 4675 transitions. [2020-09-21 10:22:50,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:22:50,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2020-09-21 10:22:50,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:22:50,128 INFO L225 Difference]: With dead ends: 3598 [2020-09-21 10:22:50,128 INFO L226 Difference]: Without dead ends: 1934 [2020-09-21 10:22:50,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:22:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2020-09-21 10:22:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1926. [2020-09-21 10:22:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2020-09-21 10:22:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2309 transitions. [2020-09-21 10:22:50,205 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2309 transitions. Word has length 109 [2020-09-21 10:22:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:22:50,205 INFO L479 AbstractCegarLoop]: Abstraction has 1926 states and 2309 transitions. [2020-09-21 10:22:50,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:22:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2309 transitions. [2020-09-21 10:22:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-09-21 10:22:50,211 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:22:50,212 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:22:50,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:22:50,212 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:22:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:22:50,213 INFO L82 PathProgramCache]: Analyzing trace with hash 753402114, now seen corresponding path program 1 times [2020-09-21 10:22:50,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:22:50,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [80517122] [2020-09-21 10:22:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:22:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:50,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:22:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:50,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:22:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:50,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-21 10:22:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 10:22:50,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [80517122] [2020-09-21 10:22:50,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:22:50,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:22:50,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980181628] [2020-09-21 10:22:50,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:22:50,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:22:50,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:22:50,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:22:50,455 INFO L87 Difference]: Start difference. First operand 1926 states and 2309 transitions. Second operand 7 states. [2020-09-21 10:22:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:22:51,848 INFO L93 Difference]: Finished difference Result 4966 states and 6075 transitions. [2020-09-21 10:22:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:22:51,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2020-09-21 10:22:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:22:51,866 INFO L225 Difference]: With dead ends: 4966 [2020-09-21 10:22:51,866 INFO L226 Difference]: Without dead ends: 3050 [2020-09-21 10:22:51,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:22:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3050 states. [2020-09-21 10:22:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3050 to 1537. [2020-09-21 10:22:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1537 states. [2020-09-21 10:22:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 1774 transitions. [2020-09-21 10:22:51,941 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 1774 transitions. Word has length 117 [2020-09-21 10:22:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:22:51,942 INFO L479 AbstractCegarLoop]: Abstraction has 1537 states and 1774 transitions. [2020-09-21 10:22:51,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:22:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1774 transitions. [2020-09-21 10:22:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-09-21 10:22:51,947 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:22:51,948 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 10:22:51,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:22:51,948 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:22:51,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:22:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash -978391870, now seen corresponding path program 1 times [2020-09-21 10:22:51,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:22:51,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255827926] [2020-09-21 10:22:51,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:22:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:52,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:22:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:52,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:22:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:52,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-21 10:22:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-21 10:22:52,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255827926] [2020-09-21 10:22:52,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:22:52,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:22:52,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676640146] [2020-09-21 10:22:52,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:22:52,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:22:52,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:22:52,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:22:52,173 INFO L87 Difference]: Start difference. First operand 1537 states and 1774 transitions. Second operand 8 states. [2020-09-21 10:22:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:22:53,538 INFO L93 Difference]: Finished difference Result 3777 states and 4406 transitions. [2020-09-21 10:22:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:22:53,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 149 [2020-09-21 10:22:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:22:53,550 INFO L225 Difference]: With dead ends: 3777 [2020-09-21 10:22:53,550 INFO L226 Difference]: Without dead ends: 2246 [2020-09-21 10:22:53,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:22:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2020-09-21 10:22:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2101. [2020-09-21 10:22:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2020-09-21 10:22:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2438 transitions. [2020-09-21 10:22:53,609 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2438 transitions. Word has length 149 [2020-09-21 10:22:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:22:53,610 INFO L479 AbstractCegarLoop]: Abstraction has 2101 states and 2438 transitions. [2020-09-21 10:22:53,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:22:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2438 transitions. [2020-09-21 10:22:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-09-21 10:22:53,615 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:22:53,615 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:22:53,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:22:53,616 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:22:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:22:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1274953160, now seen corresponding path program 1 times [2020-09-21 10:22:53,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:22:53,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1418387575] [2020-09-21 10:22:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:22:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:53,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:22:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:53,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:22:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:53,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-21 10:22:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 10:22:53,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1418387575] [2020-09-21 10:22:53,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:22:53,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:22:53,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148256301] [2020-09-21 10:22:53,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:22:53,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:22:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:22:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:22:53,848 INFO L87 Difference]: Start difference. First operand 2101 states and 2438 transitions. Second operand 7 states. [2020-09-21 10:22:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:22:55,057 INFO L93 Difference]: Finished difference Result 5594 states and 6579 transitions. [2020-09-21 10:22:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:22:55,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2020-09-21 10:22:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:22:55,071 INFO L225 Difference]: With dead ends: 5594 [2020-09-21 10:22:55,072 INFO L226 Difference]: Without dead ends: 3499 [2020-09-21 10:22:55,077 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:22:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2020-09-21 10:22:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 3082. [2020-09-21 10:22:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2020-09-21 10:22:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 3583 transitions. [2020-09-21 10:22:55,180 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 3583 transitions. Word has length 152 [2020-09-21 10:22:55,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:22:55,180 INFO L479 AbstractCegarLoop]: Abstraction has 3082 states and 3583 transitions. [2020-09-21 10:22:55,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:22:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 3583 transitions. [2020-09-21 10:22:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-09-21 10:22:55,188 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:22:55,189 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:22:55,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:22:55,189 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:22:55,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:22:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1080710838, now seen corresponding path program 1 times [2020-09-21 10:22:55,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:22:55,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272363516] [2020-09-21 10:22:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:22:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:55,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:22:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:55,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:22:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:55,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-21 10:22:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 115 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 10:22:55,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272363516] [2020-09-21 10:22:55,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:22:55,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:22:55,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13950094] [2020-09-21 10:22:55,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:22:55,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:22:55,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:22:55,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:22:55,470 INFO L87 Difference]: Start difference. First operand 3082 states and 3583 transitions. Second operand 7 states. [2020-09-21 10:22:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:22:56,859 INFO L93 Difference]: Finished difference Result 6597 states and 7645 transitions. [2020-09-21 10:22:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:22:56,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 177 [2020-09-21 10:22:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:22:56,873 INFO L225 Difference]: With dead ends: 6597 [2020-09-21 10:22:56,873 INFO L226 Difference]: Without dead ends: 3521 [2020-09-21 10:22:56,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:22:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2020-09-21 10:22:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 3515. [2020-09-21 10:22:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2020-09-21 10:22:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 3908 transitions. [2020-09-21 10:22:56,956 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 3908 transitions. Word has length 177 [2020-09-21 10:22:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:22:56,956 INFO L479 AbstractCegarLoop]: Abstraction has 3515 states and 3908 transitions. [2020-09-21 10:22:56,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:22:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 3908 transitions. [2020-09-21 10:22:56,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-09-21 10:22:56,964 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:22:56,965 INFO L422 BasicCegarLoop]: trace histogram [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, 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-21 10:22:56,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:22:56,965 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:22:56,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:22:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash -30452491, now seen corresponding path program 1 times [2020-09-21 10:22:56,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:22:56,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [501748705] [2020-09-21 10:22:56,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:22:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:57,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:22:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:57,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:22:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:57,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-21 10:22:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:57,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-21 10:22:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:22:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-21 10:22:57,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [501748705] [2020-09-21 10:22:57,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:22:57,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:22:57,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795360601] [2020-09-21 10:22:57,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:22:57,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:22:57,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:22:57,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:22:57,270 INFO L87 Difference]: Start difference. First operand 3515 states and 3908 transitions. Second operand 9 states. [2020-09-21 10:23:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:00,739 INFO L93 Difference]: Finished difference Result 8812 states and 9999 transitions. [2020-09-21 10:23:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:23:00,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 182 [2020-09-21 10:23:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:00,763 INFO L225 Difference]: With dead ends: 8812 [2020-09-21 10:23:00,763 INFO L226 Difference]: Without dead ends: 5438 [2020-09-21 10:23:00,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:23:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5438 states. [2020-09-21 10:23:00,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5438 to 5019. [2020-09-21 10:23:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5019 states. [2020-09-21 10:23:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5019 states to 5019 states and 5692 transitions. [2020-09-21 10:23:00,967 INFO L78 Accepts]: Start accepts. Automaton has 5019 states and 5692 transitions. Word has length 182 [2020-09-21 10:23:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:00,968 INFO L479 AbstractCegarLoop]: Abstraction has 5019 states and 5692 transitions. [2020-09-21 10:23:00,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:23:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5019 states and 5692 transitions. [2020-09-21 10:23:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-09-21 10:23:00,982 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:00,983 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-21 10:23:00,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:23:00,983 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:00,984 INFO L82 PathProgramCache]: Analyzing trace with hash -490114703, now seen corresponding path program 1 times [2020-09-21 10:23:00,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:00,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007876593] [2020-09-21 10:23:00,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:01,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:23:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:01,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 10:23:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:01,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-21 10:23:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:01,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-21 10:23:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:23:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 138 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-09-21 10:23:01,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007876593] [2020-09-21 10:23:01,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:23:01,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:23:01,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260805773] [2020-09-21 10:23:01,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:23:01,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:23:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:23:01,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:23:01,415 INFO L87 Difference]: Start difference. First operand 5019 states and 5692 transitions. Second operand 10 states. [2020-09-21 10:23:01,752 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-09-21 10:23:02,181 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-09-21 10:23:02,727 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-09-21 10:23:03,618 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2020-09-21 10:23:03,872 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2020-09-21 10:23:04,549 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2020-09-21 10:23:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:23:06,073 INFO L93 Difference]: Finished difference Result 10725 states and 12168 transitions. [2020-09-21 10:23:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-21 10:23:06,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 212 [2020-09-21 10:23:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:23:06,105 INFO L225 Difference]: With dead ends: 10725 [2020-09-21 10:23:06,105 INFO L226 Difference]: Without dead ends: 5847 [2020-09-21 10:23:06,118 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2020-09-21 10:23:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2020-09-21 10:23:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5154. [2020-09-21 10:23:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5154 states. [2020-09-21 10:23:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 5805 transitions. [2020-09-21 10:23:06,249 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 5805 transitions. Word has length 212 [2020-09-21 10:23:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:23:06,250 INFO L479 AbstractCegarLoop]: Abstraction has 5154 states and 5805 transitions. [2020-09-21 10:23:06,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:23:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 5805 transitions. [2020-09-21 10:23:06,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-21 10:23:06,267 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:23:06,267 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2020-09-21 10:23:06,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:23:06,268 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:23:06,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:23:06,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1888187350, now seen corresponding path program 1 times [2020-09-21 10:23:06,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:23:06,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1119698926] [2020-09-21 10:23:06,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:23:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:23:06,349 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:23:06,349 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:23:06,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:23:06,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:23:06 BoogieIcfgContainer [2020-09-21 10:23:06,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:23:06,425 INFO L168 Benchmark]: Toolchain (without parser) took 29592.72 ms. Allocated memory was 139.5 MB in the beginning and 579.3 MB in the end (delta: 439.9 MB). Free memory was 101.0 MB in the beginning and 388.9 MB in the end (delta: -287.9 MB). Peak memory consumption was 152.0 MB. Max. memory is 7.1 GB. [2020-09-21 10:23:06,427 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:23:06,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.79 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 100.4 MB in the beginning and 170.5 MB in the end (delta: -70.1 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:23:06,431 INFO L168 Benchmark]: Boogie Preprocessor took 137.44 ms. Allocated memory is still 205.0 MB. Free memory was 170.5 MB in the beginning and 165.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-09-21 10:23:06,433 INFO L168 Benchmark]: RCFGBuilder took 1216.95 ms. Allocated memory was 205.0 MB in the beginning and 238.0 MB in the end (delta: 33.0 MB). Free memory was 165.7 MB in the beginning and 179.0 MB in the end (delta: -13.4 MB). Peak memory consumption was 82.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:23:06,437 INFO L168 Benchmark]: TraceAbstraction took 27438.71 ms. Allocated memory was 238.0 MB in the beginning and 579.3 MB in the end (delta: 341.3 MB). Free memory was 179.0 MB in the beginning and 388.9 MB in the end (delta: -209.9 MB). Peak memory consumption was 131.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:23:06,443 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.13 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.79 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 100.4 MB in the beginning and 170.5 MB in the end (delta: -70.1 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.44 ms. Allocated memory is still 205.0 MB. Free memory was 170.5 MB in the beginning and 165.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1216.95 ms. Allocated memory was 205.0 MB in the beginning and 238.0 MB in the end (delta: 33.0 MB). Free memory was 165.7 MB in the beginning and 179.0 MB in the end (delta: -13.4 MB). Peak memory consumption was 82.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27438.71 ms. Allocated memory was 238.0 MB in the beginning and 579.3 MB in the end (delta: 341.3 MB). Free memory was 179.0 MB in the beginning and 388.9 MB in the end (delta: -209.9 MB). Peak memory consumption was 131.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 416]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND TRUE (((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)) [L55] a7 = 0 [L56] a20 = 1 [L57] a21 = 1 [L58] a16 = 4 [L59] a17 = 1 [L60] a8 = 13 [L61] return -1; [L591] RET, EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) [L416] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.2s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 332 SDtfs, 6414 SDslu, 518 SDs, 0 SdLazy, 11421 SolverSat, 1702 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5154occurred in iteration=11, 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, 11 MinimizatonAttempts, 3390 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1700 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1464 ConstructedInterpolants, 0 QuantifiedInterpolants, 580118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 643/680 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...