/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SingleStatement --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label35.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-24 15:00:12,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 15:00:12,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 15:00:12,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 15:00:12,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 15:00:12,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 15:00:12,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 15:00:12,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 15:00:12,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 15:00:12,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 15:00:12,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 15:00:12,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 15:00:12,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 15:00:12,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 15:00:12,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 15:00:12,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 15:00:12,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 15:00:12,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 15:00:12,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 15:00:12,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 15:00:12,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 15:00:12,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 15:00:12,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 15:00:12,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 15:00:12,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 15:00:12,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 15:00:12,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 15:00:12,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 15:00:12,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 15:00:12,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 15:00:12,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 15:00:12,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 15:00:12,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 15:00:12,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 15:00:12,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 15:00:12,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 15:00:12,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 15:00:12,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 15:00:12,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 15:00:12,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 15:00:12,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 15:00:12,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-24 15:00:12,435 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 15:00:12,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 15:00:12,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 15:00:12,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 15:00:12,442 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 15:00:12,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 15:00:12,442 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 15:00:12,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 15:00:12,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 15:00:12,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 15:00:12,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 15:00:12,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 15:00:12,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 15:00:12,447 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 15:00:12,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 15:00:12,447 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 15:00:12,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 15:00:12,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 15:00:12,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 15:00:12,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 15:00:12,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 15:00:12,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 15:00:12,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 15:00:12,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 15:00:12,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 15:00:12,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 15:00:12,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 15:00:12,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 15:00:12,454 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 15:00:12,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-24 15:00:12,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 15:00:12,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 15:00:12,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 15:00:12,932 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 15:00:12,933 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 15:00:12,934 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-24 15:00:13,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f68c9f350/fced4ff410f347a08da5561bcf482723/FLAGca9db786d [2020-09-24 15:00:13,719 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 15:00:13,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem01_label35.c [2020-09-24 15:00:13,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f68c9f350/fced4ff410f347a08da5561bcf482723/FLAGca9db786d [2020-09-24 15:00:13,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f68c9f350/fced4ff410f347a08da5561bcf482723 [2020-09-24 15:00:13,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 15:00:13,988 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 15:00:13,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 15:00:13,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 15:00:13,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 15:00:13,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:00:13" (1/1) ... [2020-09-24 15:00:14,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3baf0e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:13, skipping insertion in model container [2020-09-24 15:00:14,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:00:13" (1/1) ... [2020-09-24 15:00:14,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 15:00:14,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 15:00:14,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:00:14,703 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 15:00:14,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:00:14,834 INFO L208 MainTranslator]: Completed translation [2020-09-24 15:00:14,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:14 WrapperNode [2020-09-24 15:00:14,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 15:00:14,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 15:00:14,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 15:00:14,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 15:00:14,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:14" (1/1) ... [2020-09-24 15:00:14,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:14" (1/1) ... [2020-09-24 15:00:14,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:14" (1/1) ... [2020-09-24 15:00:14,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:14" (1/1) ... [2020-09-24 15:00:14,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:14" (1/1) ... [2020-09-24 15:00:14,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:14" (1/1) ... [2020-09-24 15:00:14,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:14" (1/1) ... [2020-09-24 15:00:14,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 15:00:14,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 15:00:14,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 15:00:14,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 15:00:14,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:14" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 15:00:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 15:00:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 15:00:15,040 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 15:00:15,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 15:00:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 15:00:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 15:00:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 15:00:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 15:00:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 15:00:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 15:00:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 15:00:16,496 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 15:00:16,496 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 15:00:16,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:00:16 BoogieIcfgContainer [2020-09-24 15:00:16,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 15:00:16,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 15:00:16,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 15:00:16,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 15:00:16,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 03:00:13" (1/3) ... [2020-09-24 15:00:16,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276afaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:00:16, skipping insertion in model container [2020-09-24 15:00:16,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:00:14" (2/3) ... [2020-09-24 15:00:16,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276afaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:00:16, skipping insertion in model container [2020-09-24 15:00:16,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:00:16" (3/3) ... [2020-09-24 15:00:16,532 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label35.c [2020-09-24 15:00:16,548 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 15:00:16,564 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 15:00:16,588 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 15:00:16,629 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 15:00:16,629 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 15:00:16,629 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 15:00:16,630 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 15:00:16,630 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 15:00:16,630 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 15:00:16,630 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 15:00:16,630 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 15:00:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states. [2020-09-24 15:00:16,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-24 15:00:16,697 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:16,699 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:16,699 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:16,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash -850053121, now seen corresponding path program 1 times [2020-09-24 15:00:16,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:16,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1605302301] [2020-09-24 15:00:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:17,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:00:17,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1605302301] [2020-09-24 15:00:17,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:00:17,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-24 15:00:17,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945286031] [2020-09-24 15:00:17,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:00:17,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:17,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:00:17,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:00:17,426 INFO L87 Difference]: Start difference. First operand 525 states. Second operand 5 states. [2020-09-24 15:00:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:20,397 INFO L93 Difference]: Finished difference Result 1360 states and 1895 transitions. [2020-09-24 15:00:20,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-24 15:00:20,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-24 15:00:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:20,428 INFO L225 Difference]: With dead ends: 1360 [2020-09-24 15:00:20,428 INFO L226 Difference]: Without dead ends: 781 [2020-09-24 15:00:20,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-24 15:00:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-09-24 15:00:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 746. [2020-09-24 15:00:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2020-09-24 15:00:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 914 transitions. [2020-09-24 15:00:20,567 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 914 transitions. Word has length 108 [2020-09-24 15:00:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:20,568 INFO L479 AbstractCegarLoop]: Abstraction has 746 states and 914 transitions. [2020-09-24 15:00:20,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:00:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 914 transitions. [2020-09-24 15:00:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-09-24 15:00:20,578 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:20,579 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:20,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 15:00:20,580 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:20,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1639648560, now seen corresponding path program 1 times [2020-09-24 15:00:20,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:20,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [124185513] [2020-09-24 15:00:20,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:20,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:20,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:00:20,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [124185513] [2020-09-24 15:00:20,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:00:20,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-24 15:00:20,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529345333] [2020-09-24 15:00:20,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:00:20,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:20,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:00:20,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:00:20,833 INFO L87 Difference]: Start difference. First operand 746 states and 914 transitions. Second operand 8 states. [2020-09-24 15:00:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:23,449 INFO L93 Difference]: Finished difference Result 1887 states and 2410 transitions. [2020-09-24 15:00:23,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-24 15:00:23,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2020-09-24 15:00:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:23,463 INFO L225 Difference]: With dead ends: 1887 [2020-09-24 15:00:23,463 INFO L226 Difference]: Without dead ends: 1165 [2020-09-24 15:00:23,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-09-24 15:00:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-09-24 15:00:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1038. [2020-09-24 15:00:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2020-09-24 15:00:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1317 transitions. [2020-09-24 15:00:23,560 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1317 transitions. Word has length 129 [2020-09-24 15:00:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:23,562 INFO L479 AbstractCegarLoop]: Abstraction has 1038 states and 1317 transitions. [2020-09-24 15:00:23,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:00:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1317 transitions. [2020-09-24 15:00:23,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-09-24 15:00:23,570 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:23,571 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:23,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 15:00:23,571 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:23,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:23,573 INFO L82 PathProgramCache]: Analyzing trace with hash 626429774, now seen corresponding path program 1 times [2020-09-24 15:00:23,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:23,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1588647847] [2020-09-24 15:00:23,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:23,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:23,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:00:23,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1588647847] [2020-09-24 15:00:23,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:23,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 15:00:23,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417808353] [2020-09-24 15:00:23,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:00:23,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:23,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:00:23,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:00:23,805 INFO L87 Difference]: Start difference. First operand 1038 states and 1317 transitions. Second operand 5 states. [2020-09-24 15:00:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:25,850 INFO L93 Difference]: Finished difference Result 2655 states and 3486 transitions. [2020-09-24 15:00:25,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 15:00:25,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2020-09-24 15:00:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:25,861 INFO L225 Difference]: With dead ends: 2655 [2020-09-24 15:00:25,861 INFO L226 Difference]: Without dead ends: 1641 [2020-09-24 15:00:25,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 15:00:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2020-09-24 15:00:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1328. [2020-09-24 15:00:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2020-09-24 15:00:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1660 transitions. [2020-09-24 15:00:25,923 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1660 transitions. Word has length 129 [2020-09-24 15:00:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:25,924 INFO L479 AbstractCegarLoop]: Abstraction has 1328 states and 1660 transitions. [2020-09-24 15:00:25,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:00:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1660 transitions. [2020-09-24 15:00:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-24 15:00:25,929 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:25,929 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:25,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 15:00:25,929 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:25,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1999519641, now seen corresponding path program 1 times [2020-09-24 15:00:25,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:25,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [630763133] [2020-09-24 15:00:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:26,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:26,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:00:26,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [630763133] [2020-09-24 15:00:26,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:00:26,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-24 15:00:26,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705562885] [2020-09-24 15:00:26,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 15:00:26,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:26,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 15:00:26,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:00:26,241 INFO L87 Difference]: Start difference. First operand 1328 states and 1660 transitions. Second operand 9 states. [2020-09-24 15:00:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:29,562 INFO L93 Difference]: Finished difference Result 2989 states and 3825 transitions. [2020-09-24 15:00:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-24 15:00:29,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2020-09-24 15:00:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:29,573 INFO L225 Difference]: With dead ends: 2989 [2020-09-24 15:00:29,573 INFO L226 Difference]: Without dead ends: 1685 [2020-09-24 15:00:29,579 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-09-24 15:00:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2020-09-24 15:00:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1623. [2020-09-24 15:00:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2020-09-24 15:00:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 1990 transitions. [2020-09-24 15:00:29,635 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 1990 transitions. Word has length 133 [2020-09-24 15:00:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:29,636 INFO L479 AbstractCegarLoop]: Abstraction has 1623 states and 1990 transitions. [2020-09-24 15:00:29,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 15:00:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 1990 transitions. [2020-09-24 15:00:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-09-24 15:00:29,642 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:29,642 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:29,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 15:00:29,643 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:29,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:29,644 INFO L82 PathProgramCache]: Analyzing trace with hash -247402504, now seen corresponding path program 1 times [2020-09-24 15:00:29,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:29,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [955177497] [2020-09-24 15:00:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:29,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:29,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:29,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-24 15:00:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:00:29,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [955177497] [2020-09-24 15:00:29,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:29,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:00:29,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226811479] [2020-09-24 15:00:29,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:00:29,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:29,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:00:29,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:00:29,919 INFO L87 Difference]: Start difference. First operand 1623 states and 1990 transitions. Second operand 8 states. [2020-09-24 15:00:30,234 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-09-24 15:00:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:33,609 INFO L93 Difference]: Finished difference Result 3982 states and 4920 transitions. [2020-09-24 15:00:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-24 15:00:33,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 154 [2020-09-24 15:00:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:33,620 INFO L225 Difference]: With dead ends: 3982 [2020-09-24 15:00:33,621 INFO L226 Difference]: Without dead ends: 1975 [2020-09-24 15:00:33,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-09-24 15:00:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2020-09-24 15:00:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1941. [2020-09-24 15:00:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-09-24 15:00:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2255 transitions. [2020-09-24 15:00:33,693 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2255 transitions. Word has length 154 [2020-09-24 15:00:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:33,693 INFO L479 AbstractCegarLoop]: Abstraction has 1941 states and 2255 transitions. [2020-09-24 15:00:33,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:00:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2255 transitions. [2020-09-24 15:00:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-09-24 15:00:33,699 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:33,699 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:33,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-24 15:00:33,700 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1106704956, now seen corresponding path program 1 times [2020-09-24 15:00:33,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:33,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1802993563] [2020-09-24 15:00:33,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:33,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:33,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:33,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-24 15:00:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:00:34,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1802993563] [2020-09-24 15:00:34,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:34,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-24 15:00:34,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463565731] [2020-09-24 15:00:34,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:00:34,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:00:34,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:00:34,030 INFO L87 Difference]: Start difference. First operand 1941 states and 2255 transitions. Second operand 8 states. [2020-09-24 15:00:34,612 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-09-24 15:00:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:36,624 INFO L93 Difference]: Finished difference Result 4750 states and 5648 transitions. [2020-09-24 15:00:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-24 15:00:36,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 162 [2020-09-24 15:00:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:36,638 INFO L225 Difference]: With dead ends: 4750 [2020-09-24 15:00:36,638 INFO L226 Difference]: Without dead ends: 2843 [2020-09-24 15:00:36,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-09-24 15:00:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2020-09-24 15:00:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 1667. [2020-09-24 15:00:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1667 states. [2020-09-24 15:00:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 1909 transitions. [2020-09-24 15:00:36,710 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 1909 transitions. Word has length 162 [2020-09-24 15:00:36,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:36,711 INFO L479 AbstractCegarLoop]: Abstraction has 1667 states and 1909 transitions. [2020-09-24 15:00:36,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:00:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 1909 transitions. [2020-09-24 15:00:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-09-24 15:00:36,717 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:36,717 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:36,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-24 15:00:36,718 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:36,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1061697879, now seen corresponding path program 1 times [2020-09-24 15:00:36,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:36,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [432141926] [2020-09-24 15:00:36,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:36,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:36,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:36,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-24 15:00:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 79 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:00:36,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [432141926] [2020-09-24 15:00:36,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:36,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:00:36,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81664265] [2020-09-24 15:00:36,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:00:36,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:36,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:00:36,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:00:36,979 INFO L87 Difference]: Start difference. First operand 1667 states and 1909 transitions. Second operand 7 states. [2020-09-24 15:00:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:38,840 INFO L93 Difference]: Finished difference Result 4157 states and 4814 transitions. [2020-09-24 15:00:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-24 15:00:38,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2020-09-24 15:00:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:38,852 INFO L225 Difference]: With dead ends: 4157 [2020-09-24 15:00:38,853 INFO L226 Difference]: Without dead ends: 2514 [2020-09-24 15:00:38,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-24 15:00:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2020-09-24 15:00:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2452. [2020-09-24 15:00:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2452 states. [2020-09-24 15:00:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 2810 transitions. [2020-09-24 15:00:38,923 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 2810 transitions. Word has length 192 [2020-09-24 15:00:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:38,924 INFO L479 AbstractCegarLoop]: Abstraction has 2452 states and 2810 transitions. [2020-09-24 15:00:38,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:00:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 2810 transitions. [2020-09-24 15:00:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-09-24 15:00:38,930 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:38,931 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:38,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-24 15:00:38,931 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:38,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:38,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2072108716, now seen corresponding path program 1 times [2020-09-24 15:00:38,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:38,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2064975008] [2020-09-24 15:00:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:39,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:39,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:39,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-24 15:00:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:00:39,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2064975008] [2020-09-24 15:00:39,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:39,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:00:39,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997493103] [2020-09-24 15:00:39,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:00:39,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:39,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:00:39,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:00:39,222 INFO L87 Difference]: Start difference. First operand 2452 states and 2810 transitions. Second operand 7 states. [2020-09-24 15:00:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:41,524 INFO L93 Difference]: Finished difference Result 5905 states and 6810 transitions. [2020-09-24 15:00:41,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:00:41,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2020-09-24 15:00:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:41,545 INFO L225 Difference]: With dead ends: 5905 [2020-09-24 15:00:41,545 INFO L226 Difference]: Without dead ends: 3618 [2020-09-24 15:00:41,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-24 15:00:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3618 states. [2020-09-24 15:00:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3618 to 3574. [2020-09-24 15:00:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2020-09-24 15:00:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4007 transitions. [2020-09-24 15:00:41,646 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4007 transitions. Word has length 218 [2020-09-24 15:00:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:41,647 INFO L479 AbstractCegarLoop]: Abstraction has 3574 states and 4007 transitions. [2020-09-24 15:00:41,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:00:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4007 transitions. [2020-09-24 15:00:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2020-09-24 15:00:41,655 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:41,656 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2020-09-24 15:00:41,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-24 15:00:41,656 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash 728492872, now seen corresponding path program 1 times [2020-09-24 15:00:41,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:41,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [550891700] [2020-09-24 15:00:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:41,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:41,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:41,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-24 15:00:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:41,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2020-09-24 15:00:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 117 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-24 15:00:41,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [550891700] [2020-09-24 15:00:41,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:41,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:00:41,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405336111] [2020-09-24 15:00:41,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:00:41,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:41,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:00:41,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:00:41,918 INFO L87 Difference]: Start difference. First operand 3574 states and 4007 transitions. Second operand 7 states. [2020-09-24 15:00:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:44,191 INFO L93 Difference]: Finished difference Result 7244 states and 8122 transitions. [2020-09-24 15:00:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:00:44,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2020-09-24 15:00:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:44,207 INFO L225 Difference]: With dead ends: 7244 [2020-09-24 15:00:44,207 INFO L226 Difference]: Without dead ends: 3835 [2020-09-24 15:00:44,216 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-24 15:00:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2020-09-24 15:00:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3634. [2020-09-24 15:00:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2020-09-24 15:00:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 4017 transitions. [2020-09-24 15:00:44,300 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 4017 transitions. Word has length 223 [2020-09-24 15:00:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:44,300 INFO L479 AbstractCegarLoop]: Abstraction has 3634 states and 4017 transitions. [2020-09-24 15:00:44,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:00:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 4017 transitions. [2020-09-24 15:00:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-09-24 15:00:44,309 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:44,310 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:44,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-24 15:00:44,310 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:44,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1107733327, now seen corresponding path program 1 times [2020-09-24 15:00:44,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:44,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1772217852] [2020-09-24 15:00:44,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:44,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:44,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:44,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-24 15:00:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:44,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-24 15:00:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 138 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-24 15:00:44,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1772217852] [2020-09-24 15:00:44,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:44,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-24 15:00:44,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918897307] [2020-09-24 15:00:44,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 15:00:44,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:44,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 15:00:44,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:00:44,669 INFO L87 Difference]: Start difference. First operand 3634 states and 4017 transitions. Second operand 9 states. [2020-09-24 15:00:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:49,928 INFO L93 Difference]: Finished difference Result 10648 states and 12033 transitions. [2020-09-24 15:00:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-24 15:00:49,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 237 [2020-09-24 15:00:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:49,958 INFO L225 Difference]: With dead ends: 10648 [2020-09-24 15:00:49,958 INFO L226 Difference]: Without dead ends: 7179 [2020-09-24 15:00:49,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2020-09-24 15:00:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2020-09-24 15:00:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6734. [2020-09-24 15:00:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6734 states. [2020-09-24 15:00:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6734 states to 6734 states and 7598 transitions. [2020-09-24 15:00:50,148 INFO L78 Accepts]: Start accepts. Automaton has 6734 states and 7598 transitions. Word has length 237 [2020-09-24 15:00:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:50,149 INFO L479 AbstractCegarLoop]: Abstraction has 6734 states and 7598 transitions. [2020-09-24 15:00:50,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 15:00:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 6734 states and 7598 transitions. [2020-09-24 15:00:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-09-24 15:00:50,169 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:50,170 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:50,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-24 15:00:50,171 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:50,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1842625301, now seen corresponding path program 1 times [2020-09-24 15:00:50,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:50,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [552674202] [2020-09-24 15:00:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:50,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:50,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:50,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-24 15:00:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:50,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-24 15:00:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 151 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-24 15:00:50,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [552674202] [2020-09-24 15:00:50,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:50,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:00:50,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682522405] [2020-09-24 15:00:50,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:00:50,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:50,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:00:50,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:00:50,492 INFO L87 Difference]: Start difference. First operand 6734 states and 7598 transitions. Second operand 7 states. [2020-09-24 15:00:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:00:52,183 INFO L93 Difference]: Finished difference Result 13396 states and 15172 transitions. [2020-09-24 15:00:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:00:52,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2020-09-24 15:00:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:00:52,210 INFO L225 Difference]: With dead ends: 13396 [2020-09-24 15:00:52,210 INFO L226 Difference]: Without dead ends: 6669 [2020-09-24 15:00:52,233 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-24 15:00:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6669 states. [2020-09-24 15:00:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6669 to 6414. [2020-09-24 15:00:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6414 states. [2020-09-24 15:00:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6414 states to 6414 states and 7140 transitions. [2020-09-24 15:00:52,435 INFO L78 Accepts]: Start accepts. Automaton has 6414 states and 7140 transitions. Word has length 240 [2020-09-24 15:00:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:00:52,436 INFO L479 AbstractCegarLoop]: Abstraction has 6414 states and 7140 transitions. [2020-09-24 15:00:52,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:00:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6414 states and 7140 transitions. [2020-09-24 15:00:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2020-09-24 15:00:52,452 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:00:52,453 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:00:52,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-24 15:00:52,453 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:00:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:00:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1964589244, now seen corresponding path program 1 times [2020-09-24 15:00:52,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:00:52,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1827783604] [2020-09-24 15:00:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:00:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:52,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:00:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:52,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-24 15:00:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:52,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-24 15:00:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:52,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-24 15:00:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:00:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 164 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-09-24 15:00:53,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1827783604] [2020-09-24 15:00:53,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:00:53,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-24 15:00:53,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807839911] [2020-09-24 15:00:53,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-24 15:00:53,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:00:53,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-24 15:00:53,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-09-24 15:00:53,218 INFO L87 Difference]: Start difference. First operand 6414 states and 7140 transitions. Second operand 13 states. [2020-09-24 15:00:53,547 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-09-24 15:00:53,796 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2020-09-24 15:00:54,226 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2020-09-24 15:00:54,521 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2020-09-24 15:00:54,897 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-09-24 15:00:55,360 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2020-09-24 15:00:55,755 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2020-09-24 15:00:56,188 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2020-09-24 15:00:56,371 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2020-09-24 15:00:59,126 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2020-09-24 15:01:00,376 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-09-24 15:01:01,254 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2020-09-24 15:01:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:01:03,711 INFO L93 Difference]: Finished difference Result 15978 states and 17876 transitions. [2020-09-24 15:01:03,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-09-24 15:01:03,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 266 [2020-09-24 15:01:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:01:03,741 INFO L225 Difference]: With dead ends: 15978 [2020-09-24 15:01:03,741 INFO L226 Difference]: Without dead ends: 9729 [2020-09-24 15:01:03,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2020-09-24 15:01:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9729 states. [2020-09-24 15:01:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9729 to 7180. [2020-09-24 15:01:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7180 states. [2020-09-24 15:01:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7180 states to 7180 states and 7994 transitions. [2020-09-24 15:01:03,963 INFO L78 Accepts]: Start accepts. Automaton has 7180 states and 7994 transitions. Word has length 266 [2020-09-24 15:01:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:01:03,964 INFO L479 AbstractCegarLoop]: Abstraction has 7180 states and 7994 transitions. [2020-09-24 15:01:03,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-24 15:01:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7180 states and 7994 transitions. [2020-09-24 15:01:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2020-09-24 15:01:03,983 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:01:03,984 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:01:03,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-24 15:01:03,985 INFO L427 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:01:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:01:03,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1575104130, now seen corresponding path program 1 times [2020-09-24 15:01:03,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:01:03,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1397021698] [2020-09-24 15:01:03,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:01:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 15:01:04,076 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 15:01:04,076 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 15:01:04,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-24 15:01:04,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 03:01:04 BoogieIcfgContainer [2020-09-24 15:01:04,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 15:01:04,169 INFO L168 Benchmark]: Toolchain (without parser) took 50186.38 ms. Allocated memory was 138.9 MB in the beginning and 737.1 MB in the end (delta: 598.2 MB). Free memory was 100.1 MB in the beginning and 451.2 MB in the end (delta: -351.1 MB). Peak memory consumption was 247.1 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:04,170 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-09-24 15:01:04,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 846.11 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 99.5 MB in the beginning and 169.2 MB in the end (delta: -69.7 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:04,172 INFO L168 Benchmark]: Boogie Preprocessor took 117.26 ms. Allocated memory is still 203.9 MB. Free memory was 169.2 MB in the beginning and 164.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:04,180 INFO L168 Benchmark]: RCFGBuilder took 1562.88 ms. Allocated memory was 203.9 MB in the beginning and 235.9 MB in the end (delta: 32.0 MB). Free memory was 164.3 MB in the beginning and 157.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:04,181 INFO L168 Benchmark]: TraceAbstraction took 47649.43 ms. Allocated memory was 235.9 MB in the beginning and 737.1 MB in the end (delta: 501.2 MB). Free memory was 157.7 MB in the beginning and 451.2 MB in the end (delta: -293.5 MB). Peak memory consumption was 207.7 MB. Max. memory is 7.1 GB. [2020-09-24 15:01:04,190 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 846.11 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 99.5 MB in the beginning and 169.2 MB in the end (delta: -69.7 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.26 ms. Allocated memory is still 203.9 MB. Free memory was 169.2 MB in the beginning and 164.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1562.88 ms. Allocated memory was 203.9 MB in the beginning and 235.9 MB in the end (delta: 32.0 MB). Free memory was 164.3 MB in the beginning and 157.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47649.43 ms. Allocated memory was 235.9 MB in the beginning and 737.1 MB in the end (delta: 501.2 MB). Free memory was 157.7 MB in the beginning and 451.2 MB in the end (delta: -293.5 MB). Peak memory consumption was 207.7 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, 525 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 47.4s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 41.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3877 SDtfs, 15001 SDslu, 5900 SDs, 0 SdLazy, 21302 SolverSat, 1769 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7180occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 5303 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2478 NumberOfCodeBlocks, 2478 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2179 ConstructedInterpolants, 0 QuantifiedInterpolants, 1183392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 1005/1065 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...