/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 true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.6 --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-25 06:47:08,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-25 06:47:08,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-25 06:47:08,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-25 06:47:08,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-25 06:47:08,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-25 06:47:08,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-25 06:47:08,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-25 06:47:08,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-25 06:47:08,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-25 06:47:08,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-25 06:47:08,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-25 06:47:08,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-25 06:47:08,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-25 06:47:08,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-25 06:47:08,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-25 06:47:08,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-25 06:47:08,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-25 06:47:08,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-25 06:47:08,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-25 06:47:08,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-25 06:47:08,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-25 06:47:08,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-25 06:47:08,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-25 06:47:08,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-25 06:47:08,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-25 06:47:08,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-25 06:47:08,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-25 06:47:08,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-25 06:47:08,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-25 06:47:08,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-25 06:47:08,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-25 06:47:08,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-25 06:47:08,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-25 06:47:08,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-25 06:47:08,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-25 06:47:08,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-25 06:47:08,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-25 06:47:08,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-25 06:47:08,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-25 06:47:08,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-25 06:47:08,695 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-25 06:47:08,724 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-25 06:47:08,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-25 06:47:08,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-25 06:47:08,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-25 06:47:08,726 INFO L138 SettingsManager]: * Use SBE=true [2020-09-25 06:47:08,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-25 06:47:08,727 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-25 06:47:08,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-25 06:47:08,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-25 06:47:08,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-25 06:47:08,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-25 06:47:08,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-25 06:47:08,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-25 06:47:08,728 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-25 06:47:08,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-25 06:47:08,729 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-25 06:47:08,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-25 06:47:08,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-25 06:47:08,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-25 06:47:08,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-25 06:47:08,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-25 06:47:08,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-25 06:47:08,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-25 06:47:08,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-25 06:47:08,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-25 06:47:08,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-25 06:47:08,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-25 06:47:08,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-25 06:47:08,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-25 06:47:08,732 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 -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6;log-additional-information=true; [2020-09-25 06:47:09,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-25 06:47:09,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-25 06:47:09,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-25 06:47:09,221 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-25 06:47:09,223 INFO L275 PluginConnector]: CDTParser initialized [2020-09-25 06:47:09,224 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-25 06:47:09,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/809724cc5/5acb343ac7154c8aa415eb1521b23ea3/FLAGc2f93bdc1 [2020-09-25 06:47:09,979 INFO L306 CDTParser]: Found 1 translation units. [2020-09-25 06:47:09,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-25 06:47:09,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/809724cc5/5acb343ac7154c8aa415eb1521b23ea3/FLAGc2f93bdc1 [2020-09-25 06:47:10,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/809724cc5/5acb343ac7154c8aa415eb1521b23ea3 [2020-09-25 06:47:10,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-25 06:47:10,237 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-25 06:47:10,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-25 06:47:10,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-25 06:47:10,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-25 06:47:10,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 06:47:10" (1/1) ... [2020-09-25 06:47:10,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4957d7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:10, skipping insertion in model container [2020-09-25 06:47:10,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 06:47:10" (1/1) ... [2020-09-25 06:47:10,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-25 06:47:10,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-25 06:47:10,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 06:47:10,948 INFO L203 MainTranslator]: Completed pre-run [2020-09-25 06:47:11,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-25 06:47:11,145 INFO L208 MainTranslator]: Completed translation [2020-09-25 06:47:11,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:11 WrapperNode [2020-09-25 06:47:11,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-25 06:47:11,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-25 06:47:11,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-25 06:47:11,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-25 06:47:11,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:11" (1/1) ... [2020-09-25 06:47:11,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:11" (1/1) ... [2020-09-25 06:47:11,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:11" (1/1) ... [2020-09-25 06:47:11,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:11" (1/1) ... [2020-09-25 06:47:11,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:11" (1/1) ... [2020-09-25 06:47:11,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:11" (1/1) ... [2020-09-25 06:47:11,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:11" (1/1) ... [2020-09-25 06:47:11,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-25 06:47:11,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-25 06:47:11,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-25 06:47:11,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-25 06:47:11,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:11" (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-25 06:47:11,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-25 06:47:11,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-25 06:47:11,449 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-25 06:47:11,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-25 06:47:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-25 06:47:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-25 06:47:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-25 06:47:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-25 06:47:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-25 06:47:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-25 06:47:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-25 06:47:13,045 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-25 06:47:13,046 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-25 06:47:13,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 06:47:13 BoogieIcfgContainer [2020-09-25 06:47:13,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-25 06:47:13,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-25 06:47:13,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-25 06:47:13,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-25 06:47:13,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 06:47:10" (1/3) ... [2020-09-25 06:47:13,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c504154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 06:47:13, skipping insertion in model container [2020-09-25 06:47:13,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 06:47:11" (2/3) ... [2020-09-25 06:47:13,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c504154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 06:47:13, skipping insertion in model container [2020-09-25 06:47:13,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 06:47:13" (3/3) ... [2020-09-25 06:47:13,067 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label15.c [2020-09-25 06:47:13,080 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-25 06:47:13,092 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-25 06:47:13,117 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-25 06:47:13,154 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-25 06:47:13,154 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-25 06:47:13,154 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-25 06:47:13,154 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-25 06:47:13,155 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-25 06:47:13,155 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-25 06:47:13,155 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-25 06:47:13,155 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-25 06:47:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-25 06:47:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-25 06:47:13,198 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 06:47:13,199 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] [2020-09-25 06:47:13,200 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 06:47:13,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 06:47:13,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1814812065, now seen corresponding path program 1 times [2020-09-25 06:47:13,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 06:47:13,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [912990279] [2020-09-25 06:47:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 06:47:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:13,462 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:13,631 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:13,670 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:13,914 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:13,915 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 38 [2020-09-25 06:47:13,915 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 06:47:13,915 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 510 [2020-09-25 06:47:13,919 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:13,919 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:13,919 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 06:47:13,920 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 11 [2020-09-25 06:47:13,920 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-09-25 06:47:13,920 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-09-25 06:47:14,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 06:47:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:14,036 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:14,055 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:14,056 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 06:47:14,056 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:14,056 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 22 [2020-09-25 06:47:14,057 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:14,057 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:14,057 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 06:47:14,057 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:14,058 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 7 [2020-09-25 06:47:14,058 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:14,079 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-25 06:47:14,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [912990279] [2020-09-25 06:47:14,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 06:47:14,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-25 06:47:14,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306472065] [2020-09-25 06:47:14,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-25 06:47:14,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 06:47:14,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-25 06:47:14,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-25 06:47:14,116 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-25 06:47:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 06:47:16,345 INFO L93 Difference]: Finished difference Result 1104 states and 1521 transitions. [2020-09-25 06:47:16,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-25 06:47:16,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-09-25 06:47:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 06:47:16,374 INFO L225 Difference]: With dead ends: 1104 [2020-09-25 06:47:16,374 INFO L226 Difference]: Without dead ends: 578 [2020-09-25 06:47:16,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-25 06:47:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-09-25 06:47:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 544. [2020-09-25 06:47:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-09-25 06:47:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 655 transitions. [2020-09-25 06:47:16,481 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 655 transitions. Word has length 29 [2020-09-25 06:47:16,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 06:47:16,481 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 655 transitions. [2020-09-25 06:47:16,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-25 06:47:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 655 transitions. [2020-09-25 06:47:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-25 06:47:16,488 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 06:47:16,489 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 06:47:16,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-25 06:47:16,489 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 06:47:16,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 06:47:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash -908534672, now seen corresponding path program 1 times [2020-09-25 06:47:16,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 06:47:16,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [71958325] [2020-09-25 06:47:16,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 06:47:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:16,580 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:16,729 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:16,873 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:17,075 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:17,430 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:19,266 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:19,267 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 119 [2020-09-25 06:47:19,267 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-09-25 06:47:19,267 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2725 [2020-09-25 06:47:19,268 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:19,268 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:19,268 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 06:47:19,268 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 94 [2020-09-25 06:47:19,269 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 24 [2020-09-25 06:47:19,269 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:19,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 06:47:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:19,335 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:19,344 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:19,344 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 06:47:19,345 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:19,345 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-25 06:47:19,345 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:19,345 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:19,346 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 06:47:19,346 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:19,346 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 06:47:19,346 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:19,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 06:47:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:19,391 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:19,499 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:19,500 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-25 06:47:19,509 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:19,509 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 122 [2020-09-25 06:47:19,510 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:19,511 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:19,511 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 06:47:19,511 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:19,511 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-09-25 06:47:19,512 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 06:47:19,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [71958325] [2020-09-25 06:47:19,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 06:47:19,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 06:47:19,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669293104] [2020-09-25 06:47:19,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 06:47:19,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 06:47:19,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 06:47:19,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 06:47:19,567 INFO L87 Difference]: Start difference. First operand 544 states and 655 transitions. Second operand 5 states. [2020-09-25 06:47:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 06:47:21,366 INFO L93 Difference]: Finished difference Result 1224 states and 1530 transitions. [2020-09-25 06:47:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 06:47:21,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-09-25 06:47:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 06:47:21,372 INFO L225 Difference]: With dead ends: 1224 [2020-09-25 06:47:21,372 INFO L226 Difference]: Without dead ends: 695 [2020-09-25 06:47:21,374 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-25 06:47:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2020-09-25 06:47:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2020-09-25 06:47:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2020-09-25 06:47:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 850 transitions. [2020-09-25 06:47:21,436 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 850 transitions. Word has length 108 [2020-09-25 06:47:21,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 06:47:21,438 INFO L479 AbstractCegarLoop]: Abstraction has 695 states and 850 transitions. [2020-09-25 06:47:21,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 06:47:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 850 transitions. [2020-09-25 06:47:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-09-25 06:47:21,446 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 06:47:21,446 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 06:47:21,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-25 06:47:21,450 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 06:47:21,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 06:47:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash -162546798, now seen corresponding path program 1 times [2020-09-25 06:47:21,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 06:47:21,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832319609] [2020-09-25 06:47:21,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 06:47:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:21,524 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:21,630 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:21,727 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:21,864 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:22,208 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:24,120 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:24,121 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 129 [2020-09-25 06:47:24,121 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-09-25 06:47:24,121 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2628 [2020-09-25 06:47:24,121 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:24,122 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:24,122 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-09-25 06:47:24,122 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 103 [2020-09-25 06:47:24,122 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-09-25 06:47:24,122 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:24,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 06:47:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:24,213 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:24,224 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:24,224 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 06:47:24,224 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:24,225 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-09-25 06:47:24,225 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:24,225 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:24,226 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 06:47:24,226 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:24,226 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 06:47:24,226 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:24,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 06:47:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:24,305 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:24,446 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:24,446 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 06:47:24,446 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:24,447 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 159 [2020-09-25 06:47:24,447 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:24,447 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:24,447 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 3 [2020-09-25 06:47:24,448 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:24,448 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-09-25 06:47:24,448 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 06:47:24,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832319609] [2020-09-25 06:47:24,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 06:47:24,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-25 06:47:24,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730706720] [2020-09-25 06:47:24,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-25 06:47:24,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 06:47:24,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-25 06:47:24,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-25 06:47:24,517 INFO L87 Difference]: Start difference. First operand 695 states and 850 transitions. Second operand 6 states. [2020-09-25 06:47:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 06:47:27,394 INFO L93 Difference]: Finished difference Result 1905 states and 2481 transitions. [2020-09-25 06:47:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-25 06:47:27,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2020-09-25 06:47:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 06:47:27,404 INFO L225 Difference]: With dead ends: 1905 [2020-09-25 06:47:27,404 INFO L226 Difference]: Without dead ends: 1375 [2020-09-25 06:47:27,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-25 06:47:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-09-25 06:47:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1319. [2020-09-25 06:47:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2020-09-25 06:47:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1695 transitions. [2020-09-25 06:47:27,463 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1695 transitions. Word has length 118 [2020-09-25 06:47:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 06:47:27,464 INFO L479 AbstractCegarLoop]: Abstraction has 1319 states and 1695 transitions. [2020-09-25 06:47:27,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-25 06:47:27,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1695 transitions. [2020-09-25 06:47:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-25 06:47:27,467 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 06:47:27,467 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-25 06:47:27,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-25 06:47:27,468 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 06:47:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 06:47:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash -878375990, now seen corresponding path program 1 times [2020-09-25 06:47:27,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 06:47:27,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770434819] [2020-09-25 06:47:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 06:47:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:27,529 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:27,735 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:27,805 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:28,816 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:28,817 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 131 [2020-09-25 06:47:28,817 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 06:47:28,817 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1312 [2020-09-25 06:47:28,817 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:28,818 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:28,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 06:47:28,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 13 [2020-09-25 06:47:28,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-09-25 06:47:28,818 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:28,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 06:47:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:28,904 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:28,918 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:28,918 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 06:47:28,918 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:28,919 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 17 [2020-09-25 06:47:28,919 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:28,919 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:28,919 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 06:47:28,920 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:28,920 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 9 [2020-09-25 06:47:28,921 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:28,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 06:47:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:28,970 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:29,103 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:29,103 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 87 [2020-09-25 06:47:29,104 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:29,104 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 147 [2020-09-25 06:47:29,104 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:29,104 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:29,105 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 06:47:29,105 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 06:47:29,105 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 86 [2020-09-25 06:47:29,105 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-25 06:47:29,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770434819] [2020-09-25 06:47:29,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-25 06:47:29,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-25 06:47:29,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600678399] [2020-09-25 06:47:29,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-25 06:47:29,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 06:47:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-25 06:47:29,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-25 06:47:29,188 INFO L87 Difference]: Start difference. First operand 1319 states and 1695 transitions. Second operand 8 states. [2020-09-25 06:47:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 06:47:31,966 INFO L93 Difference]: Finished difference Result 4211 states and 5814 transitions. [2020-09-25 06:47:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-25 06:47:31,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 120 [2020-09-25 06:47:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 06:47:31,997 INFO L225 Difference]: With dead ends: 4211 [2020-09-25 06:47:31,998 INFO L226 Difference]: Without dead ends: 3057 [2020-09-25 06:47:32,006 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-09-25 06:47:32,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2020-09-25 06:47:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2723. [2020-09-25 06:47:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2020-09-25 06:47:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3520 transitions. [2020-09-25 06:47:32,173 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3520 transitions. Word has length 120 [2020-09-25 06:47:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 06:47:32,175 INFO L479 AbstractCegarLoop]: Abstraction has 2723 states and 3520 transitions. [2020-09-25 06:47:32,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-25 06:47:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3520 transitions. [2020-09-25 06:47:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-25 06:47:32,196 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 06:47:32,196 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-25 06:47:32,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-25 06:47:32,197 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 06:47:32,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 06:47:32,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2145286015, now seen corresponding path program 1 times [2020-09-25 06:47:32,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 06:47:32,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2040448051] [2020-09-25 06:47:32,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 06:47:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:32,294 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:32,466 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:32,594 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:32,773 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:33,137 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:34,634 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:37,251 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:37,252 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 233 [2020-09-25 06:47:37,252 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 6 [2020-09-25 06:47:37,252 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5001 [2020-09-25 06:47:37,253 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:37,253 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:37,253 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 06:47:37,253 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 106 [2020-09-25 06:47:37,254 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 104 [2020-09-25 06:47:37,254 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:37,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 06:47:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:37,328 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:37,336 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:37,336 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 06:47:37,336 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:37,336 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-25 06:47:37,337 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:37,337 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:37,337 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 06:47:37,337 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:37,337 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 06:47:37,338 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:37,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 06:47:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:37,379 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:37,447 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:37,448 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-25 06:47:37,448 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:37,448 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 81 [2020-09-25 06:47:37,448 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:37,449 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:37,452 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 06:47:37,452 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:37,452 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-09-25 06:47:37,453 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-09-25 06:47:37,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-25 06:47:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:37,528 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:37,680 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:37,680 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 98 [2020-09-25 06:47:37,680 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:37,681 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 171 [2020-09-25 06:47:37,681 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:37,681 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:37,681 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 06:47:37,682 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-25 06:47:37,682 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-09-25 06:47:37,682 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-25 06:47:37,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2040448051] [2020-09-25 06:47:37,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 06:47:37,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-25 06:47:37,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932611522] [2020-09-25 06:47:37,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-25 06:47:37,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 06:47:37,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-25 06:47:37,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-25 06:47:37,817 INFO L87 Difference]: Start difference. First operand 2723 states and 3520 transitions. Second operand 7 states. [2020-09-25 06:47:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 06:47:40,478 INFO L93 Difference]: Finished difference Result 5829 states and 7745 transitions. [2020-09-25 06:47:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-25 06:47:40,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2020-09-25 06:47:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 06:47:40,492 INFO L225 Difference]: With dead ends: 5829 [2020-09-25 06:47:40,493 INFO L226 Difference]: Without dead ends: 2447 [2020-09-25 06:47:40,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-25 06:47:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2020-09-25 06:47:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2365. [2020-09-25 06:47:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2020-09-25 06:47:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 2869 transitions. [2020-09-25 06:47:40,575 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 2869 transitions. Word has length 220 [2020-09-25 06:47:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 06:47:40,576 INFO L479 AbstractCegarLoop]: Abstraction has 2365 states and 2869 transitions. [2020-09-25 06:47:40,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-25 06:47:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2869 transitions. [2020-09-25 06:47:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-09-25 06:47:40,582 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 06:47:40,582 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-25 06:47:40,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-25 06:47:40,583 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 06:47:40,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 06:47:40,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1265665838, now seen corresponding path program 1 times [2020-09-25 06:47:40,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 06:47:40,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1674323917] [2020-09-25 06:47:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 06:47:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:40,694 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:41,104 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:41,357 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:42,446 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:42,446 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 299 [2020-09-25 06:47:42,446 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-25 06:47:42,446 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1802 [2020-09-25 06:47:42,446 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:42,447 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:42,447 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-25 06:47:42,447 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 163 [2020-09-25 06:47:42,447 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 135 [2020-09-25 06:47:42,447 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 06:47:42,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 06:47:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:42,534 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:42,541 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:42,542 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 06:47:42,542 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:42,542 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-25 06:47:42,542 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:42,542 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:42,543 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 06:47:42,543 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:42,543 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 06:47:42,543 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:42,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 06:47:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:42,612 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:42,704 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:42,704 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-09-25 06:47:42,704 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:42,705 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 120 [2020-09-25 06:47:42,705 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:42,705 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:42,705 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 06:47:42,705 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:42,706 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 134 [2020-09-25 06:47:42,706 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 06:47:42,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-09-25 06:47:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:42,822 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:42,914 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:43,003 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:43,003 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-09-25 06:47:43,003 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-25 06:47:43,003 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 211 [2020-09-25 06:47:43,004 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:43,004 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:43,004 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 06:47:43,004 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:43,005 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-09-25 06:47:43,005 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-09-25 06:47:43,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1674323917] [2020-09-25 06:47:43,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 06:47:43,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-25 06:47:43,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328813967] [2020-09-25 06:47:43,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-25 06:47:43,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 06:47:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-25 06:47:43,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-25 06:47:43,091 INFO L87 Difference]: Start difference. First operand 2365 states and 2869 transitions. Second operand 6 states. [2020-09-25 06:47:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 06:47:45,234 INFO L93 Difference]: Finished difference Result 4428 states and 5421 transitions. [2020-09-25 06:47:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-25 06:47:45,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2020-09-25 06:47:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 06:47:45,245 INFO L225 Difference]: With dead ends: 4428 [2020-09-25 06:47:45,245 INFO L226 Difference]: Without dead ends: 2228 [2020-09-25 06:47:45,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-25 06:47:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2020-09-25 06:47:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1904. [2020-09-25 06:47:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2020-09-25 06:47:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2124 transitions. [2020-09-25 06:47:45,300 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2124 transitions. Word has length 286 [2020-09-25 06:47:45,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 06:47:45,301 INFO L479 AbstractCegarLoop]: Abstraction has 1904 states and 2124 transitions. [2020-09-25 06:47:45,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-25 06:47:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2124 transitions. [2020-09-25 06:47:45,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2020-09-25 06:47:45,307 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 06:47:45,307 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-25 06:47:45,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-25 06:47:45,308 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 06:47:45,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 06:47:45,308 INFO L82 PathProgramCache]: Analyzing trace with hash -711589098, now seen corresponding path program 1 times [2020-09-25 06:47:45,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 06:47:45,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177284343] [2020-09-25 06:47:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 06:47:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:45,466 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:45,989 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:45,989 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 317 [2020-09-25 06:47:45,990 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:45,990 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 587 [2020-09-25 06:47:45,990 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:45,990 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:45,990 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-25 06:47:45,990 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 294 [2020-09-25 06:47:45,991 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-09-25 06:47:45,991 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-25 06:47:46,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-25 06:47:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:46,069 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:46,075 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:46,076 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-25 06:47:46,076 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:46,076 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-09-25 06:47:46,076 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:46,077 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:46,077 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 06:47:46,077 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:46,077 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 06:47:46,077 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:46,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-25 06:47:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:46,109 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:46,133 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:46,134 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-09-25 06:47:46,134 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:46,134 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 29 [2020-09-25 06:47:46,134 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:46,134 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:46,135 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-25 06:47:46,135 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:46,135 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-25 06:47:46,135 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-25 06:47:46,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-09-25 06:47:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-25 06:47:46,229 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-25 06:47:46,312 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-25 06:47:46,312 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 147 [2020-09-25 06:47:46,313 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-25 06:47:46,313 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 107 [2020-09-25 06:47:46,313 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-09-25 06:47:46,313 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.6 [2020-09-25 06:47:46,341 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-25 06:47:46,341 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-25 06:47:46,342 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-09-25 06:47:46,342 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 28 [2020-09-25 06:47:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-09-25 06:47:46,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177284343] [2020-09-25 06:47:46,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-25 06:47:46,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-25 06:47:46,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103862300] [2020-09-25 06:47:46,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-25 06:47:46,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-25 06:47:46,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-25 06:47:46,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-25 06:47:46,451 INFO L87 Difference]: Start difference. First operand 1904 states and 2124 transitions. Second operand 5 states. [2020-09-25 06:47:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-25 06:47:48,180 INFO L93 Difference]: Finished difference Result 2060 states and 2281 transitions. [2020-09-25 06:47:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-25 06:47:48,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 304 [2020-09-25 06:47:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-25 06:47:48,190 INFO L225 Difference]: With dead ends: 2060 [2020-09-25 06:47:48,190 INFO L226 Difference]: Without dead ends: 1898 [2020-09-25 06:47:48,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-25 06:47:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-09-25 06:47:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1894. [2020-09-25 06:47:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2020-09-25 06:47:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2105 transitions. [2020-09-25 06:47:48,235 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2105 transitions. Word has length 304 [2020-09-25 06:47:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-25 06:47:48,235 INFO L479 AbstractCegarLoop]: Abstraction has 1894 states and 2105 transitions. [2020-09-25 06:47:48,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-25 06:47:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2105 transitions. [2020-09-25 06:47:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2020-09-25 06:47:48,245 INFO L414 BasicCegarLoop]: Found error trace [2020-09-25 06:47:48,245 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-25 06:47:48,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-25 06:47:48,246 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-25 06:47:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-25 06:47:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash 460101446, now seen corresponding path program 1 times [2020-09-25 06:47:48,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-25 06:47:48,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605356699] [2020-09-25 06:47:48,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-25 06:47:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-25 06:47:48,336 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-25 06:47:48,337 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-25 06:47:48,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-25 06:47:48,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 06:47:48 BoogieIcfgContainer [2020-09-25 06:47:48,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-25 06:47:48,395 INFO L168 Benchmark]: Toolchain (without parser) took 38159.28 ms. Allocated memory was 139.5 MB in the beginning and 608.7 MB in the end (delta: 469.2 MB). Free memory was 100.6 MB in the beginning and 176.0 MB in the end (delta: -75.4 MB). Peak memory consumption was 393.8 MB. Max. memory is 7.1 GB. [2020-09-25 06:47:48,396 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-25 06:47:48,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 909.16 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 99.9 MB in the beginning and 170.6 MB in the end (delta: -70.6 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2020-09-25 06:47:48,398 INFO L168 Benchmark]: Boogie Preprocessor took 182.07 ms. Allocated memory is still 205.0 MB. Free memory was 170.6 MB in the beginning and 166.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-09-25 06:47:48,399 INFO L168 Benchmark]: RCFGBuilder took 1724.03 ms. Allocated memory was 205.0 MB in the beginning and 238.0 MB in the end (delta: 33.0 MB). Free memory was 165.7 MB in the beginning and 164.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. [2020-09-25 06:47:48,400 INFO L168 Benchmark]: TraceAbstraction took 35334.71 ms. Allocated memory was 238.0 MB in the beginning and 608.7 MB in the end (delta: 370.7 MB). Free memory was 164.6 MB in the beginning and 176.0 MB in the end (delta: -11.4 MB). Peak memory consumption was 359.3 MB. Max. memory is 7.1 GB. [2020-09-25 06:47:48,404 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.22 ms. Allocated memory is still 139.5 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 909.16 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 99.9 MB in the beginning and 170.6 MB in the end (delta: -70.6 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 182.07 ms. Allocated memory is still 205.0 MB. Free memory was 170.6 MB in the beginning and 166.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1724.03 ms. Allocated memory was 205.0 MB in the beginning and 238.0 MB in the end (delta: 33.0 MB). Free memory was 165.7 MB in the beginning and 164.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35334.71 ms. Allocated memory was 238.0 MB in the beginning and 608.7 MB in the end (delta: 370.7 MB). Free memory was 164.6 MB in the beginning and 176.0 MB in the end (delta: -11.4 MB). Peak memory consumption was 359.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 34]: 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 TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L287] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L288] a19 = 10 [L290] 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 TRUE (((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)) [L482] a1 = ((((a1 * 10)/ -9) * 5) - 333686) [L483] a10 = 4 [L484] a19 = 6 [L486] 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 TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)) [L34] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.1s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1394 SDtfs, 5217 SDslu, 1913 SDs, 0 SdLazy, 8846 SolverSat, 1080 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2723occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 834 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 1567 NumberOfCodeBlocks, 1567 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1178 ConstructedInterpolants, 0 QuantifiedInterpolants, 424734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 423/431 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...