/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-21 13:23:20,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 13:23:20,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 13:23:20,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 13:23:20,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 13:23:20,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 13:23:20,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 13:23:20,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 13:23:20,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 13:23:20,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 13:23:20,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 13:23:20,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 13:23:20,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 13:23:20,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 13:23:20,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 13:23:20,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 13:23:20,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 13:23:20,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 13:23:21,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 13:23:21,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 13:23:21,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 13:23:21,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 13:23:21,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 13:23:21,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 13:23:21,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 13:23:21,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 13:23:21,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 13:23:21,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 13:23:21,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 13:23:21,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 13:23:21,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 13:23:21,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 13:23:21,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 13:23:21,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 13:23:21,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 13:23:21,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 13:23:21,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 13:23:21,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 13:23:21,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 13:23:21,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 13:23:21,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 13:23:21,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-21 13:23:21,042 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 13:23:21,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 13:23:21,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 13:23:21,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 13:23:21,044 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 13:23:21,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 13:23:21,045 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 13:23:21,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 13:23:21,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 13:23:21,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 13:23:21,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 13:23:21,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 13:23:21,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 13:23:21,046 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 13:23:21,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 13:23:21,046 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 13:23:21,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 13:23:21,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 13:23:21,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 13:23:21,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 13:23:21,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 13:23:21,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 13:23:21,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 13:23:21,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 13:23:21,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 13:23:21,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 13:23:21,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 13:23:21,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 13:23:21,049 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 13:23:21,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-21 13:23:21,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 13:23:21,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 13:23:21,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 13:23:21,397 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 13:23:21,398 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 13:23:21,399 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-08-21 13:23:21,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e6f20ee50/d8fe7c09aa95456ab0706185e7c6f8ec/FLAG7cb2e2e4e [2020-08-21 13:23:22,077 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 13:23:22,078 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-08-21 13:23:22,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e6f20ee50/d8fe7c09aa95456ab0706185e7c6f8ec/FLAG7cb2e2e4e [2020-08-21 13:23:22,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e6f20ee50/d8fe7c09aa95456ab0706185e7c6f8ec [2020-08-21 13:23:22,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 13:23:22,357 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 13:23:22,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 13:23:22,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 13:23:22,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 13:23:22,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 01:23:22" (1/1) ... [2020-08-21 13:23:22,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406521a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:22, skipping insertion in model container [2020-08-21 13:23:22,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 01:23:22" (1/1) ... [2020-08-21 13:23:22,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 13:23:22,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 13:23:22,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 13:23:22,901 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 13:23:23,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 13:23:23,139 INFO L208 MainTranslator]: Completed translation [2020-08-21 13:23:23,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:23 WrapperNode [2020-08-21 13:23:23,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 13:23:23,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 13:23:23,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 13:23:23,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 13:23:23,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:23" (1/1) ... [2020-08-21 13:23:23,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:23" (1/1) ... [2020-08-21 13:23:23,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:23" (1/1) ... [2020-08-21 13:23:23,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:23" (1/1) ... [2020-08-21 13:23:23,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:23" (1/1) ... [2020-08-21 13:23:23,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:23" (1/1) ... [2020-08-21 13:23:23,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:23" (1/1) ... [2020-08-21 13:23:23,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 13:23:23,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 13:23:23,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 13:23:23,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 13:23:23,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:23" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 13:23:23,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 13:23:23,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 13:23:23,332 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-08-21 13:23:23,332 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 13:23:23,333 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-08-21 13:23:23,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 13:23:23,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 13:23:23,333 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-08-21 13:23:23,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 13:23:23,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 13:23:23,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 13:23:24,746 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 13:23:24,747 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-21 13:23:24,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 01:23:24 BoogieIcfgContainer [2020-08-21 13:23:24,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 13:23:24,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 13:23:24,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 13:23:24,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 13:23:24,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 01:23:22" (1/3) ... [2020-08-21 13:23:24,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d2b406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 01:23:24, skipping insertion in model container [2020-08-21 13:23:24,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 01:23:23" (2/3) ... [2020-08-21 13:23:24,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d2b406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 01:23:24, skipping insertion in model container [2020-08-21 13:23:24,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 01:23:24" (3/3) ... [2020-08-21 13:23:24,772 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-08-21 13:23:24,784 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 13:23:24,794 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 13:23:24,811 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 13:23:24,849 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 13:23:24,850 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 13:23:24,850 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 13:23:24,850 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 13:23:24,850 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 13:23:24,850 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 13:23:24,851 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 13:23:24,851 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 13:23:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-08-21 13:23:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-08-21 13:23:24,892 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:24,894 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] [2020-08-21 13:23:24,894 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash -42109674, now seen corresponding path program 1 times [2020-08-21 13:23:24,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:24,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584323280] [2020-08-21 13:23:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:25,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:23:25,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584323280] [2020-08-21 13:23:25,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:23:25,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-21 13:23:25,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343686310] [2020-08-21 13:23:25,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-08-21 13:23:25,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:25,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-08-21 13:23:25,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-08-21 13:23:25,289 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-08-21 13:23:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:23:26,916 INFO L93 Difference]: Finished difference Result 596 states and 1021 transitions. [2020-08-21 13:23:26,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 13:23:26,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-08-21 13:23:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:23:26,954 INFO L225 Difference]: With dead ends: 596 [2020-08-21 13:23:26,954 INFO L226 Difference]: Without dead ends: 302 [2020-08-21 13:23:26,968 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-08-21 13:23:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-08-21 13:23:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2020-08-21 13:23:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-08-21 13:23:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 430 transitions. [2020-08-21 13:23:27,058 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 430 transitions. Word has length 23 [2020-08-21 13:23:27,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:23:27,058 INFO L479 AbstractCegarLoop]: Abstraction has 298 states and 430 transitions. [2020-08-21 13:23:27,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-08-21 13:23:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 430 transitions. [2020-08-21 13:23:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-21 13:23:27,063 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:27,063 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-08-21 13:23:27,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 13:23:27,064 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash 547923706, now seen corresponding path program 1 times [2020-08-21 13:23:27,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:27,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510236918] [2020-08-21 13:23:27,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:27,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:27,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:23:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:23:27,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510236918] [2020-08-21 13:23:27,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:23:27,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-21 13:23:27,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424349087] [2020-08-21 13:23:27,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 13:23:27,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:27,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 13:23:27,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-21 13:23:27,461 INFO L87 Difference]: Start difference. First operand 298 states and 430 transitions. Second operand 8 states. [2020-08-21 13:23:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:23:29,633 INFO L93 Difference]: Finished difference Result 1198 states and 1805 transitions. [2020-08-21 13:23:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-21 13:23:29,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2020-08-21 13:23:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:23:29,645 INFO L225 Difference]: With dead ends: 1198 [2020-08-21 13:23:29,645 INFO L226 Difference]: Without dead ends: 906 [2020-08-21 13:23:29,649 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-08-21 13:23:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-08-21 13:23:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 894. [2020-08-21 13:23:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-08-21 13:23:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1232 transitions. [2020-08-21 13:23:29,712 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1232 transitions. Word has length 97 [2020-08-21 13:23:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:23:29,713 INFO L479 AbstractCegarLoop]: Abstraction has 894 states and 1232 transitions. [2020-08-21 13:23:29,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 13:23:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1232 transitions. [2020-08-21 13:23:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-08-21 13:23:29,718 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:29,718 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-08-21 13:23:29,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 13:23:29,719 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1249958265, now seen corresponding path program 1 times [2020-08-21 13:23:29,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:29,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190112765] [2020-08-21 13:23:29,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:29,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:29,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:23:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:23:29,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190112765] [2020-08-21 13:23:29,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:23:29,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 13:23:29,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523366210] [2020-08-21 13:23:29,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 13:23:29,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:29,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 13:23:29,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-08-21 13:23:29,951 INFO L87 Difference]: Start difference. First operand 894 states and 1232 transitions. Second operand 8 states. [2020-08-21 13:23:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:23:31,841 INFO L93 Difference]: Finished difference Result 2080 states and 2940 transitions. [2020-08-21 13:23:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-21 13:23:31,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2020-08-21 13:23:31,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:23:31,853 INFO L225 Difference]: With dead ends: 2080 [2020-08-21 13:23:31,853 INFO L226 Difference]: Without dead ends: 1192 [2020-08-21 13:23:31,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-08-21 13:23:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-08-21 13:23:31,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1188. [2020-08-21 13:23:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2020-08-21 13:23:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1482 transitions. [2020-08-21 13:23:31,902 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1482 transitions. Word has length 102 [2020-08-21 13:23:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:23:31,903 INFO L479 AbstractCegarLoop]: Abstraction has 1188 states and 1482 transitions. [2020-08-21 13:23:31,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 13:23:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1482 transitions. [2020-08-21 13:23:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-21 13:23:31,910 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:31,910 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 13:23:31,910 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 13:23:31,911 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:31,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:31,911 INFO L82 PathProgramCache]: Analyzing trace with hash -99512690, now seen corresponding path program 1 times [2020-08-21 13:23:31,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:31,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [143688175] [2020-08-21 13:23:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:31,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:32,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:23:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:23:32,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [143688175] [2020-08-21 13:23:32,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:23:32,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-21 13:23:32,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444498691] [2020-08-21 13:23:32,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 13:23:32,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:32,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 13:23:32,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-21 13:23:32,191 INFO L87 Difference]: Start difference. First operand 1188 states and 1482 transitions. Second operand 8 states. [2020-08-21 13:23:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:23:33,618 INFO L93 Difference]: Finished difference Result 3008 states and 3961 transitions. [2020-08-21 13:23:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-21 13:23:33,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-08-21 13:23:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:23:33,634 INFO L225 Difference]: With dead ends: 3008 [2020-08-21 13:23:33,634 INFO L226 Difference]: Without dead ends: 1826 [2020-08-21 13:23:33,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-08-21 13:23:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2020-08-21 13:23:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1776. [2020-08-21 13:23:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2020-08-21 13:23:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2206 transitions. [2020-08-21 13:23:33,732 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2206 transitions. Word has length 123 [2020-08-21 13:23:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:23:33,733 INFO L479 AbstractCegarLoop]: Abstraction has 1776 states and 2206 transitions. [2020-08-21 13:23:33,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 13:23:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2206 transitions. [2020-08-21 13:23:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-21 13:23:33,743 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:33,743 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 13:23:33,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 13:23:33,744 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1701421403, now seen corresponding path program 1 times [2020-08-21 13:23:33,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:33,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1346965937] [2020-08-21 13:23:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:33,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:33,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:23:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 13:23:33,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1346965937] [2020-08-21 13:23:33,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 13:23:33,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-21 13:23:33,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708102354] [2020-08-21 13:23:33,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:23:33,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:23:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:23:33,987 INFO L87 Difference]: Start difference. First operand 1776 states and 2206 transitions. Second operand 7 states. [2020-08-21 13:23:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:23:35,278 INFO L93 Difference]: Finished difference Result 3725 states and 4639 transitions. [2020-08-21 13:23:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 13:23:35,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2020-08-21 13:23:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:23:35,292 INFO L225 Difference]: With dead ends: 3725 [2020-08-21 13:23:35,292 INFO L226 Difference]: Without dead ends: 1955 [2020-08-21 13:23:35,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-08-21 13:23:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2020-08-21 13:23:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1941. [2020-08-21 13:23:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-08-21 13:23:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2395 transitions. [2020-08-21 13:23:35,354 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2395 transitions. Word has length 140 [2020-08-21 13:23:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:23:35,355 INFO L479 AbstractCegarLoop]: Abstraction has 1941 states and 2395 transitions. [2020-08-21 13:23:35,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:23:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2395 transitions. [2020-08-21 13:23:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-08-21 13:23:35,357 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:35,358 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 13:23:35,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 13:23:35,359 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:35,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:35,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1059967410, now seen corresponding path program 1 times [2020-08-21 13:23:35,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:35,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1769877662] [2020-08-21 13:23:35,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:35,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 13:23:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:35,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-21 13:23:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 13:23:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-08-21 13:23:35,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1769877662] [2020-08-21 13:23:35,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 13:23:35,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 13:23:35,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069345129] [2020-08-21 13:23:35,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 13:23:35,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 13:23:35,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 13:23:35,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-08-21 13:23:35,648 INFO L87 Difference]: Start difference. First operand 1941 states and 2395 transitions. Second operand 7 states. [2020-08-21 13:23:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 13:23:37,518 INFO L93 Difference]: Finished difference Result 3109 states and 3927 transitions. [2020-08-21 13:23:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-21 13:23:37,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2020-08-21 13:23:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 13:23:37,536 INFO L225 Difference]: With dead ends: 3109 [2020-08-21 13:23:37,536 INFO L226 Difference]: Without dead ends: 3107 [2020-08-21 13:23:37,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-08-21 13:23:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2020-08-21 13:23:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 1951. [2020-08-21 13:23:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2020-08-21 13:23:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2413 transitions. [2020-08-21 13:23:37,614 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2413 transitions. Word has length 157 [2020-08-21 13:23:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 13:23:37,614 INFO L479 AbstractCegarLoop]: Abstraction has 1951 states and 2413 transitions. [2020-08-21 13:23:37,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 13:23:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2413 transitions. [2020-08-21 13:23:37,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-08-21 13:23:37,619 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 13:23:37,619 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-08-21 13:23:37,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 13:23:37,620 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 13:23:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 13:23:37,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2040878078, now seen corresponding path program 1 times [2020-08-21 13:23:37,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 13:23:37,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1692775540] [2020-08-21 13:23:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 13:23:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 13:23:37,719 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 13:23:37,719 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 13:23:37,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 13:23:37,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 01:23:37 BoogieIcfgContainer [2020-08-21 13:23:37,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 13:23:37,765 INFO L168 Benchmark]: Toolchain (without parser) took 15407.51 ms. Allocated memory was 140.0 MB in the beginning and 394.8 MB in the end (delta: 254.8 MB). Free memory was 101.2 MB in the beginning and 351.9 MB in the end (delta: -250.6 MB). Peak memory consumption was 272.0 MB. Max. memory is 7.1 GB. [2020-08-21 13:23:37,765 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 13:23:37,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.67 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 171.0 MB in the end (delta: -70.0 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2020-08-21 13:23:37,767 INFO L168 Benchmark]: Boogie Preprocessor took 101.11 ms. Allocated memory is still 205.0 MB. Free memory was 171.0 MB in the beginning and 166.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-08-21 13:23:37,768 INFO L168 Benchmark]: RCFGBuilder took 1517.46 ms. Allocated memory was 205.0 MB in the beginning and 239.1 MB in the end (delta: 34.1 MB). Free memory was 166.2 MB in the beginning and 180.3 MB in the end (delta: -14.1 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. [2020-08-21 13:23:37,769 INFO L168 Benchmark]: TraceAbstraction took 13000.35 ms. Allocated memory was 239.1 MB in the beginning and 394.8 MB in the end (delta: 155.7 MB). Free memory was 180.3 MB in the beginning and 351.9 MB in the end (delta: -171.5 MB). Peak memory consumption was 252.0 MB. Max. memory is 7.1 GB. [2020-08-21 13:23:37,773 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.21 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.67 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 171.0 MB in the end (delta: -70.0 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.11 ms. Allocated memory is still 205.0 MB. Free memory was 171.0 MB in the beginning and 166.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1517.46 ms. Allocated memory was 205.0 MB in the beginning and 239.1 MB in the end (delta: 34.1 MB). Free memory was 166.2 MB in the beginning and 180.3 MB in the end (delta: -14.1 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13000.35 ms. Allocated memory was 239.1 MB in the beginning and 394.8 MB in the end (delta: 155.7 MB). Free memory was 180.3 MB in the beginning and 351.9 MB in the end (delta: -171.5 MB). Peak memory consumption was 252.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 55]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] return 22; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L55] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 148 SDtfs, 4607 SDslu, 201 SDs, 0 SdLazy, 5536 SolverSat, 1239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1951occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 1240 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 847 NumberOfCodeBlocks, 847 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 636 ConstructedInterpolants, 0 QuantifiedInterpolants, 202158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 75/80 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...