/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/Problem10_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-24 15:04:02,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 15:04:02,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 15:04:02,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 15:04:02,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 15:04:02,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 15:04:02,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 15:04:02,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 15:04:02,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 15:04:02,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 15:04:02,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 15:04:02,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 15:04:02,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 15:04:02,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 15:04:02,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 15:04:02,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 15:04:02,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 15:04:02,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 15:04:02,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 15:04:02,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 15:04:02,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 15:04:02,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 15:04:02,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 15:04:02,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 15:04:02,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 15:04:02,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 15:04:02,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 15:04:02,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 15:04:02,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 15:04:02,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 15:04:02,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 15:04:02,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 15:04:02,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 15:04:02,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 15:04:02,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 15:04:02,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 15:04:02,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 15:04:02,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 15:04:02,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 15:04:02,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 15:04:02,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 15:04:02,759 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:04:02,787 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 15:04:02,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 15:04:02,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 15:04:02,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 15:04:02,790 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 15:04:02,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 15:04:02,790 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 15:04:02,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 15:04:02,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 15:04:02,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 15:04:02,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 15:04:02,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 15:04:02,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 15:04:02,794 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 15:04:02,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 15:04:02,794 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 15:04:02,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 15:04:02,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 15:04:02,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 15:04:02,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 15:04:02,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 15:04:02,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 15:04:02,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 15:04:02,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 15:04:02,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 15:04:02,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 15:04:02,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 15:04:02,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 15:04:02,798 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 15:04:02,799 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:04:03,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 15:04:03,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 15:04:03,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 15:04:03,311 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 15:04:03,312 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 15:04:03,313 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-09-24 15:04:03,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5dfcb810f/1f5bb89499384dff9002eb28faf964c2/FLAG27db23434 [2020-09-24 15:04:04,005 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 15:04:04,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-09-24 15:04:04,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5dfcb810f/1f5bb89499384dff9002eb28faf964c2/FLAG27db23434 [2020-09-24 15:04:04,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5dfcb810f/1f5bb89499384dff9002eb28faf964c2 [2020-09-24 15:04:04,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 15:04:04,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 15:04:04,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 15:04:04,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 15:04:04,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 15:04:04,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:04:04" (1/1) ... [2020-09-24 15:04:04,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738c85d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:04, skipping insertion in model container [2020-09-24 15:04:04,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:04:04" (1/1) ... [2020-09-24 15:04:04,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 15:04:04,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 15:04:04,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:04:04,937 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 15:04:05,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:04:05,266 INFO L208 MainTranslator]: Completed translation [2020-09-24 15:04:05,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:05 WrapperNode [2020-09-24 15:04:05,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 15:04:05,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 15:04:05,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 15:04:05,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 15:04:05,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:05" (1/1) ... [2020-09-24 15:04:05,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:05" (1/1) ... [2020-09-24 15:04:05,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:05" (1/1) ... [2020-09-24 15:04:05,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:05" (1/1) ... [2020-09-24 15:04:05,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:05" (1/1) ... [2020-09-24 15:04:05,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:05" (1/1) ... [2020-09-24 15:04:05,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:05" (1/1) ... [2020-09-24 15:04:05,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 15:04:05,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 15:04:05,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 15:04:05,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 15:04:05,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:05" (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:04:05,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 15:04:05,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 15:04:05,501 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 15:04:05,501 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 15:04:05,501 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 15:04:05,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 15:04:05,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 15:04:05,502 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 15:04:05,502 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 15:04:05,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 15:04:05,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 15:04:07,007 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 15:04:07,008 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 15:04:07,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:04:07 BoogieIcfgContainer [2020-09-24 15:04:07,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 15:04:07,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 15:04:07,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 15:04:07,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 15:04:07,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 03:04:04" (1/3) ... [2020-09-24 15:04:07,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728c409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:04:07, skipping insertion in model container [2020-09-24 15:04:07,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:04:05" (2/3) ... [2020-09-24 15:04:07,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728c409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:04:07, skipping insertion in model container [2020-09-24 15:04:07,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:04:07" (3/3) ... [2020-09-24 15:04:07,027 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-09-24 15:04:07,040 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 15:04:07,051 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 15:04:07,075 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 15:04:07,112 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 15:04:07,112 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 15:04:07,113 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 15:04:07,113 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 15:04:07,113 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 15:04:07,113 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 15:04:07,113 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 15:04:07,114 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 15:04:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-24 15:04:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-24 15:04:07,155 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:07,156 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] [2020-09-24 15:04:07,157 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash -18090369, now seen corresponding path program 1 times [2020-09-24 15:04:07,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:07,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [791069953] [2020-09-24 15:04:07,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:07,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:07,598 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:04:07,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [791069953] [2020-09-24 15:04:07,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:04:07,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-24 15:04:07,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397381881] [2020-09-24 15:04:07,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:04:07,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:07,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:04:07,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:04:07,642 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 5 states. [2020-09-24 15:04:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:10,577 INFO L93 Difference]: Finished difference Result 1256 states and 1826 transitions. [2020-09-24 15:04:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-24 15:04:10,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-09-24 15:04:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:10,604 INFO L225 Difference]: With dead ends: 1256 [2020-09-24 15:04:10,605 INFO L226 Difference]: Without dead ends: 737 [2020-09-24 15:04:10,616 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:04:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2020-09-24 15:04:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 697. [2020-09-24 15:04:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-09-24 15:04:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 864 transitions. [2020-09-24 15:04:10,726 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 864 transitions. Word has length 37 [2020-09-24 15:04:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:10,726 INFO L479 AbstractCegarLoop]: Abstraction has 697 states and 864 transitions. [2020-09-24 15:04:10,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:04:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 864 transitions. [2020-09-24 15:04:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-09-24 15:04:10,734 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:10,735 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:10,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 15:04:10,735 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:10,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1402205087, now seen corresponding path program 1 times [2020-09-24 15:04:10,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:10,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727322837] [2020-09-24 15:04:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:10,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:11,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 15:04:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:04:11,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727322837] [2020-09-24 15:04:11,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:04:11,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-24 15:04:11,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640779183] [2020-09-24 15:04:11,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:04:11,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:11,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:04:11,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:04:11,186 INFO L87 Difference]: Start difference. First operand 697 states and 864 transitions. Second operand 7 states. [2020-09-24 15:04:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:13,575 INFO L93 Difference]: Finished difference Result 1553 states and 1921 transitions. [2020-09-24 15:04:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-24 15:04:13,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2020-09-24 15:04:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:13,584 INFO L225 Difference]: With dead ends: 1553 [2020-09-24 15:04:13,584 INFO L226 Difference]: Without dead ends: 871 [2020-09-24 15:04:13,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-09-24 15:04:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2020-09-24 15:04:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 853. [2020-09-24 15:04:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2020-09-24 15:04:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1039 transitions. [2020-09-24 15:04:13,661 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1039 transitions. Word has length 133 [2020-09-24 15:04:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:13,665 INFO L479 AbstractCegarLoop]: Abstraction has 853 states and 1039 transitions. [2020-09-24 15:04:13,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:04:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1039 transitions. [2020-09-24 15:04:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-09-24 15:04:13,681 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:13,682 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:13,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 15:04:13,682 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:13,687 INFO L82 PathProgramCache]: Analyzing trace with hash -813641416, now seen corresponding path program 1 times [2020-09-24 15:04:13,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:13,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1464584552] [2020-09-24 15:04:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:13,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:13,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 15:04:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:04:14,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1464584552] [2020-09-24 15:04:14,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:04:14,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-24 15:04:14,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360176934] [2020-09-24 15:04:14,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-24 15:04:14,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-24 15:04:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-24 15:04:14,040 INFO L87 Difference]: Start difference. First operand 853 states and 1039 transitions. Second operand 8 states. [2020-09-24 15:04:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:16,310 INFO L93 Difference]: Finished difference Result 1913 states and 2473 transitions. [2020-09-24 15:04:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-24 15:04:16,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2020-09-24 15:04:16,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:16,327 INFO L225 Difference]: With dead ends: 1913 [2020-09-24 15:04:16,327 INFO L226 Difference]: Without dead ends: 1225 [2020-09-24 15:04:16,332 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-09-24 15:04:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-09-24 15:04:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1175. [2020-09-24 15:04:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2020-09-24 15:04:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1400 transitions. [2020-09-24 15:04:16,399 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1400 transitions. Word has length 142 [2020-09-24 15:04:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:16,400 INFO L479 AbstractCegarLoop]: Abstraction has 1175 states and 1400 transitions. [2020-09-24 15:04:16,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-24 15:04:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1400 transitions. [2020-09-24 15:04:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-09-24 15:04:16,404 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:16,404 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:04:16,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 15:04:16,405 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:16,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:16,405 INFO L82 PathProgramCache]: Analyzing trace with hash -490843662, now seen corresponding path program 1 times [2020-09-24 15:04:16,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:16,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1733919135] [2020-09-24 15:04:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:16,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:16,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 15:04:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:16,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-24 15:04:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-09-24 15:04:16,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1733919135] [2020-09-24 15:04:16,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:04:16,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-24 15:04:16,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068905350] [2020-09-24 15:04:16,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 15:04:16,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:16,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 15:04:16,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:04:16,814 INFO L87 Difference]: Start difference. First operand 1175 states and 1400 transitions. Second operand 9 states. [2020-09-24 15:04:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:19,742 INFO L93 Difference]: Finished difference Result 2104 states and 2623 transitions. [2020-09-24 15:04:19,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-24 15:04:19,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 212 [2020-09-24 15:04:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:19,754 INFO L225 Difference]: With dead ends: 2104 [2020-09-24 15:04:19,755 INFO L226 Difference]: Without dead ends: 2102 [2020-09-24 15:04:19,756 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-09-24 15:04:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2020-09-24 15:04:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1639. [2020-09-24 15:04:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1639 states. [2020-09-24 15:04:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2059 transitions. [2020-09-24 15:04:19,812 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2059 transitions. Word has length 212 [2020-09-24 15:04:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:19,813 INFO L479 AbstractCegarLoop]: Abstraction has 1639 states and 2059 transitions. [2020-09-24 15:04:19,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 15:04:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2059 transitions. [2020-09-24 15:04:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-09-24 15:04:19,827 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:19,828 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:19,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 15:04:19,828 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1357596281, now seen corresponding path program 1 times [2020-09-24 15:04:19,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:19,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687647896] [2020-09-24 15:04:19,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:19,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:19,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 15:04:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:20,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-24 15:04:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 115 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:04:20,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687647896] [2020-09-24 15:04:20,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:04:20,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-24 15:04:20,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390881544] [2020-09-24 15:04:20,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 15:04:20,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:20,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 15:04:20,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:04:20,230 INFO L87 Difference]: Start difference. First operand 1639 states and 2059 transitions. Second operand 7 states. [2020-09-24 15:04:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:22,600 INFO L93 Difference]: Finished difference Result 3469 states and 4461 transitions. [2020-09-24 15:04:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 15:04:22,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 267 [2020-09-24 15:04:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:22,614 INFO L225 Difference]: With dead ends: 3469 [2020-09-24 15:04:22,614 INFO L226 Difference]: Without dead ends: 1995 [2020-09-24 15:04:22,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-09-24 15:04:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2020-09-24 15:04:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1655. [2020-09-24 15:04:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2020-09-24 15:04:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2044 transitions. [2020-09-24 15:04:22,699 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2044 transitions. Word has length 267 [2020-09-24 15:04:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:22,699 INFO L479 AbstractCegarLoop]: Abstraction has 1655 states and 2044 transitions. [2020-09-24 15:04:22,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 15:04:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2044 transitions. [2020-09-24 15:04:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2020-09-24 15:04:22,705 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:22,705 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:04:22,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-24 15:04:22,706 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1691170341, now seen corresponding path program 1 times [2020-09-24 15:04:22,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:22,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2055577510] [2020-09-24 15:04:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:22,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:04:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:22,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 15:04:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:22,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-24 15:04:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:04:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 117 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:04:23,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2055577510] [2020-09-24 15:04:23,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:04:23,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-24 15:04:23,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490235003] [2020-09-24 15:04:23,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-24 15:04:23,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:04:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-24 15:04:23,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-09-24 15:04:23,250 INFO L87 Difference]: Start difference. First operand 1655 states and 2044 transitions. Second operand 11 states. [2020-09-24 15:04:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:04:27,296 INFO L93 Difference]: Finished difference Result 4070 states and 5082 transitions. [2020-09-24 15:04:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-24 15:04:27,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 277 [2020-09-24 15:04:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:04:27,306 INFO L225 Difference]: With dead ends: 4070 [2020-09-24 15:04:27,307 INFO L226 Difference]: Without dead ends: 1905 [2020-09-24 15:04:27,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2020-09-24 15:04:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2020-09-24 15:04:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1443. [2020-09-24 15:04:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2020-09-24 15:04:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1595 transitions. [2020-09-24 15:04:27,362 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1595 transitions. Word has length 277 [2020-09-24 15:04:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:04:27,363 INFO L479 AbstractCegarLoop]: Abstraction has 1443 states and 1595 transitions. [2020-09-24 15:04:27,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-24 15:04:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1595 transitions. [2020-09-24 15:04:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2020-09-24 15:04:27,369 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:04:27,370 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-24 15:04:27,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-24 15:04:27,371 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:04:27,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:04:27,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1920210634, now seen corresponding path program 1 times [2020-09-24 15:04:27,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:04:27,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [549461194] [2020-09-24 15:04:27,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:04:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 15:04:27,452 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 15:04:27,452 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 15:04:27,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-24 15:04:27,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 03:04:27 BoogieIcfgContainer [2020-09-24 15:04:27,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 15:04:27,510 INFO L168 Benchmark]: Toolchain (without parser) took 23249.17 ms. Allocated memory was 143.7 MB in the beginning and 486.0 MB in the end (delta: 342.4 MB). Free memory was 100.0 MB in the beginning and 354.5 MB in the end (delta: -254.5 MB). Peak memory consumption was 87.8 MB. Max. memory is 7.1 GB. [2020-09-24 15:04:27,511 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 143.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-24 15:04:27,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1003.61 ms. Allocated memory was 143.7 MB in the beginning and 203.9 MB in the end (delta: 60.3 MB). Free memory was 99.3 MB in the beginning and 170.5 MB in the end (delta: -71.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2020-09-24 15:04:27,513 INFO L168 Benchmark]: Boogie Preprocessor took 148.09 ms. Allocated memory is still 203.9 MB. Free memory was 170.5 MB in the beginning and 166.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2020-09-24 15:04:27,514 INFO L168 Benchmark]: RCFGBuilder took 1598.35 ms. Allocated memory was 203.9 MB in the beginning and 234.4 MB in the end (delta: 30.4 MB). Free memory was 166.1 MB in the beginning and 164.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 86.5 MB. Max. memory is 7.1 GB. [2020-09-24 15:04:27,515 INFO L168 Benchmark]: TraceAbstraction took 20488.48 ms. Allocated memory was 234.4 MB in the beginning and 486.0 MB in the end (delta: 251.7 MB). Free memory was 164.4 MB in the beginning and 354.5 MB in the end (delta: -190.1 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. [2020-09-24 15:04:27,518 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 143.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1003.61 ms. Allocated memory was 143.7 MB in the beginning and 203.9 MB in the end (delta: 60.3 MB). Free memory was 99.3 MB in the beginning and 170.5 MB in the end (delta: -71.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.09 ms. Allocated memory is still 203.9 MB. Free memory was 170.5 MB in the beginning and 166.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1598.35 ms. Allocated memory was 203.9 MB in the beginning and 234.4 MB in the end (delta: 30.4 MB). Free memory was 166.1 MB in the beginning and 164.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 86.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20488.48 ms. Allocated memory was 234.4 MB in the beginning and 486.0 MB in the end (delta: 251.7 MB). Free memory was 164.4 MB in the beginning and 354.5 MB in the end (delta: -190.1 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: 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 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 FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [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 FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] 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 FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L58] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.3s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1238 SDtfs, 7689 SDslu, 2228 SDs, 0 SdLazy, 9173 SolverSat, 1638 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1655occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 1373 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1380 NumberOfCodeBlocks, 1380 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1062 ConstructedInterpolants, 0 QuantifiedInterpolants, 622489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 378/405 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...