/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 SequenceOfStatements --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=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.2 --traceabstraction.additional.smt.options log-additional-information=true --traceabstraction.additional.smt.options unknown-allowed=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-14 20:53:08,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-14 20:53:08,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-14 20:53:08,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-14 20:53:08,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-14 20:53:08,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-14 20:53:08,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-14 20:53:08,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-14 20:53:08,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-14 20:53:08,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-14 20:53:08,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-14 20:53:08,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-14 20:53:08,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-14 20:53:08,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-14 20:53:08,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-14 20:53:08,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-14 20:53:08,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-14 20:53:08,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-14 20:53:08,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-14 20:53:08,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-14 20:53:08,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-14 20:53:08,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-14 20:53:08,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-14 20:53:08,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-14 20:53:08,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-14 20:53:08,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-14 20:53:08,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-14 20:53:08,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-14 20:53:08,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-14 20:53:08,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-14 20:53:08,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-14 20:53:08,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-14 20:53:08,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-14 20:53:08,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-14 20:53:08,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-14 20:53:08,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-14 20:53:08,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-14 20:53:08,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-14 20:53:08,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-14 20:53:08,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-14 20:53:08,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-14 20:53:08,431 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-10-14 20:53:08,453 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-14 20:53:08,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-14 20:53:08,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-14 20:53:08,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-14 20:53:08,455 INFO L138 SettingsManager]: * Use SBE=true [2020-10-14 20:53:08,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-14 20:53:08,455 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-14 20:53:08,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-14 20:53:08,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-14 20:53:08,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-14 20:53:08,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-14 20:53:08,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-14 20:53:08,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-14 20:53:08,457 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-14 20:53:08,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-14 20:53:08,457 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-14 20:53:08,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-14 20:53:08,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-14 20:53:08,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-14 20:53:08,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-14 20:53:08,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-14 20:53:08,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-14 20:53:08,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-14 20:53:08,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-14 20:53:08,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-14 20:53:08,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-14 20:53:08,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-14 20:53:08,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-14 20:53:08,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-14 20:53:08,460 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 -> SequenceOfStatements 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=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=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=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=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=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=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=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=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=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=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=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=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=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true;unknown-allowed=true; [2020-10-14 20:53:08,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-14 20:53:08,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-14 20:53:08,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-14 20:53:08,811 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-14 20:53:08,811 INFO L275 PluginConnector]: CDTParser initialized [2020-10-14 20:53:08,812 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label28.c [2020-10-14 20:53:08,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0bc76242a/fb8b11e967da4a31808648426d342f43/FLAG333bfcfd2 [2020-10-14 20:53:09,492 INFO L306 CDTParser]: Found 1 translation units. [2020-10-14 20:53:09,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label28.c [2020-10-14 20:53:09,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0bc76242a/fb8b11e967da4a31808648426d342f43/FLAG333bfcfd2 [2020-10-14 20:53:09,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0bc76242a/fb8b11e967da4a31808648426d342f43 [2020-10-14 20:53:09,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-14 20:53:09,730 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-14 20:53:09,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-14 20:53:09,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-14 20:53:09,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-14 20:53:09,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:53:09" (1/1) ... [2020-10-14 20:53:09,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc1b413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:09, skipping insertion in model container [2020-10-14 20:53:09,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:53:09" (1/1) ... [2020-10-14 20:53:09,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-14 20:53:09,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-14 20:53:10,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 20:53:10,339 INFO L203 MainTranslator]: Completed pre-run [2020-10-14 20:53:10,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 20:53:10,492 INFO L208 MainTranslator]: Completed translation [2020-10-14 20:53:10,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:10 WrapperNode [2020-10-14 20:53:10,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-14 20:53:10,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-14 20:53:10,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-14 20:53:10,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-14 20:53:10,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:10" (1/1) ... [2020-10-14 20:53:10,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:10" (1/1) ... [2020-10-14 20:53:10,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:10" (1/1) ... [2020-10-14 20:53:10,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:10" (1/1) ... [2020-10-14 20:53:10,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:10" (1/1) ... [2020-10-14 20:53:10,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:10" (1/1) ... [2020-10-14 20:53:10,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:10" (1/1) ... [2020-10-14 20:53:10,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-14 20:53:10,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-14 20:53:10,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-14 20:53:10,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-14 20:53:10,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:10" (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-10-14 20:53:10,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-14 20:53:10,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-14 20:53:10,725 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-14 20:53:10,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-14 20:53:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-14 20:53:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-14 20:53:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-14 20:53:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-14 20:53:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-14 20:53:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-14 20:53:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-14 20:53:12,114 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-14 20:53:12,115 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-14 20:53:12,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:53:12 BoogieIcfgContainer [2020-10-14 20:53:12,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-14 20:53:12,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-14 20:53:12,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-14 20:53:12,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-14 20:53:12,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:53:09" (1/3) ... [2020-10-14 20:53:12,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2646d34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:53:12, skipping insertion in model container [2020-10-14 20:53:12,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:53:10" (2/3) ... [2020-10-14 20:53:12,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2646d34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:53:12, skipping insertion in model container [2020-10-14 20:53:12,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:53:12" (3/3) ... [2020-10-14 20:53:12,130 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label28.c [2020-10-14 20:53:12,141 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-14 20:53:12,149 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-14 20:53:12,163 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-14 20:53:12,189 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-14 20:53:12,189 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-14 20:53:12,190 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-14 20:53:12,190 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-14 20:53:12,190 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-14 20:53:12,190 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-14 20:53:12,190 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-14 20:53:12,190 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-14 20:53:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-14 20:53:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-14 20:53:12,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:12,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:53:12,221 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:12,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:12,228 INFO L82 PathProgramCache]: Analyzing trace with hash 7815070, now seen corresponding path program 1 times [2020-10-14 20:53:12,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:12,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1471147588] [2020-10-14 20:53:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:12,388 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:12,672 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:12,672 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 25 [2020-10-14 20:53:12,673 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:12,673 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 314 [2020-10-14 20:53:12,676 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:12,677 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:12,677 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 20:53:12,677 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:53:12,677 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 19 [2020-10-14 20:53:12,678 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-10-14 20:53:12,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:12,824 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:12,838 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:12,839 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:12,839 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:12,839 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 17 [2020-10-14 20:53:12,839 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:12,840 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:12,840 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:12,840 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:12,840 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:53:12,841 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:53:12,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1471147588] [2020-10-14 20:53:12,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 20:53:12,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-14 20:53:12,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629086413] [2020-10-14 20:53:12,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 20:53:12,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:12,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 20:53:12,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 20:53:12,885 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-10-14 20:53:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:15,037 INFO L93 Difference]: Finished difference Result 730 states and 1300 transitions. [2020-10-14 20:53:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-14 20:53:15,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-14 20:53:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:15,058 INFO L225 Difference]: With dead ends: 730 [2020-10-14 20:53:15,058 INFO L226 Difference]: Without dead ends: 447 [2020-10-14 20:53:15,070 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-10-14 20:53:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2020-10-14 20:53:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-10-14 20:53:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 615 transitions. [2020-10-14 20:53:15,181 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 615 transitions. Word has length 17 [2020-10-14 20:53:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:15,182 INFO L479 AbstractCegarLoop]: Abstraction has 443 states and 615 transitions. [2020-10-14 20:53:15,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 20:53:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 615 transitions. [2020-10-14 20:53:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-14 20:53:15,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:15,188 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-14 20:53:15,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-14 20:53:15,189 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:15,189 INFO L82 PathProgramCache]: Analyzing trace with hash 556045594, now seen corresponding path program 1 times [2020-10-14 20:53:15,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:15,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2057781154] [2020-10-14 20:53:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:15,275 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:15,457 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:15,870 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:15,871 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-14 20:53:15,871 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:53:15,871 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 621 [2020-10-14 20:53:15,872 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:15,872 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:15,873 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-14 20:53:15,873 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:53:15,873 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-14 20:53:15,873 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:15,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:15,936 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:15,941 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:15,941 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:15,941 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:15,942 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-14 20:53:15,942 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:15,942 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:15,942 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:15,943 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:15,943 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:53:15,943 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:15,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:15,987 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:16,027 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:16,191 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:16,191 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 20:53:16,192 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:53:16,192 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 214 [2020-10-14 20:53:16,192 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:16,192 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:16,201 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:16,201 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:16,201 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-14 20:53:16,201 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 9 [2020-10-14 20:53:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-14 20:53:16,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2057781154] [2020-10-14 20:53:16,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:16,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-14 20:53:16,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146236643] [2020-10-14 20:53:16,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-14 20:53:16,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:16,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-14 20:53:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-14 20:53:16,250 INFO L87 Difference]: Start difference. First operand 443 states and 615 transitions. Second operand 6 states. [2020-10-14 20:53:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:17,885 INFO L93 Difference]: Finished difference Result 1174 states and 1717 transitions. [2020-10-14 20:53:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-14 20:53:17,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2020-10-14 20:53:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:17,901 INFO L225 Difference]: With dead ends: 1174 [2020-10-14 20:53:17,902 INFO L226 Difference]: Without dead ends: 1172 [2020-10-14 20:53:17,903 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-10-14 20:53:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-10-14 20:53:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 733. [2020-10-14 20:53:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2020-10-14 20:53:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1065 transitions. [2020-10-14 20:53:17,997 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1065 transitions. Word has length 87 [2020-10-14 20:53:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:17,998 INFO L479 AbstractCegarLoop]: Abstraction has 733 states and 1065 transitions. [2020-10-14 20:53:17,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-14 20:53:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1065 transitions. [2020-10-14 20:53:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-14 20:53:18,009 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:18,009 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 20:53:18,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-14 20:53:18,010 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:18,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:18,010 INFO L82 PathProgramCache]: Analyzing trace with hash 552964622, now seen corresponding path program 1 times [2020-10-14 20:53:18,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:18,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980573874] [2020-10-14 20:53:18,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:18,086 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:18,256 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:18,862 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:18,862 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 197 [2020-10-14 20:53:18,862 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:53:18,863 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 804 [2020-10-14 20:53:18,863 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:18,863 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:18,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:18,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-14 20:53:18,864 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 101 [2020-10-14 20:53:18,864 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:18,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:18,923 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:18,926 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:18,927 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:18,927 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:18,927 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 20:53:18,928 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:18,928 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:18,928 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:18,928 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:18,928 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:18,929 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:18,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:18,961 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:19,003 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:19,003 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 20:53:19,004 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:19,004 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 50 [2020-10-14 20:53:19,004 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:19,004 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:19,005 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:19,005 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:19,005 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-14 20:53:19,005 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:19,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-14 20:53:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:19,116 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:19,239 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:19,240 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-14 20:53:19,240 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:19,240 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 145 [2020-10-14 20:53:19,240 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:19,240 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:19,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:19,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:53:19,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-14 20:53:19,241 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 20:53:19,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [980573874] [2020-10-14 20:53:19,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:19,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:53:19,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945834969] [2020-10-14 20:53:19,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:53:19,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:19,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:53:19,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:19,369 INFO L87 Difference]: Start difference. First operand 733 states and 1065 transitions. Second operand 7 states. [2020-10-14 20:53:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:20,903 INFO L93 Difference]: Finished difference Result 1484 states and 2171 transitions. [2020-10-14 20:53:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 20:53:20,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2020-10-14 20:53:20,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:20,913 INFO L225 Difference]: With dead ends: 1484 [2020-10-14 20:53:20,913 INFO L226 Difference]: Without dead ends: 757 [2020-10-14 20:53:20,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-14 20:53:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2020-10-14 20:53:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 594. [2020-10-14 20:53:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-10-14 20:53:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 711 transitions. [2020-10-14 20:53:20,937 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 711 transitions. Word has length 185 [2020-10-14 20:53:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:20,938 INFO L479 AbstractCegarLoop]: Abstraction has 594 states and 711 transitions. [2020-10-14 20:53:20,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:53:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 711 transitions. [2020-10-14 20:53:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-10-14 20:53:20,941 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:20,942 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-10-14 20:53:20,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-14 20:53:20,942 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1276300145, now seen corresponding path program 1 times [2020-10-14 20:53:20,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:20,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1922694880] [2020-10-14 20:53:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:20,989 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:21,211 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:22,137 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:22,137 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 204 [2020-10-14 20:53:22,137 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:53:22,138 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1165 [2020-10-14 20:53:22,138 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:22,138 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:22,138 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 20:53:22,139 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:53:22,139 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 83 [2020-10-14 20:53:22,139 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:22,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:22,187 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:22,196 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:22,196 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:22,196 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:22,197 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-14 20:53:22,197 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:22,197 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:22,197 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:22,197 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:22,198 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:53:22,198 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:22,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:22,244 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:22,355 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:22,356 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 20:53:22,356 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:22,356 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 121 [2020-10-14 20:53:22,357 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:22,357 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:22,357 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:22,358 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:53:22,358 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-14 20:53:22,358 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:22,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-14 20:53:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:22,486 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:22,520 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:22,521 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-14 20:53:22,521 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:22,521 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 45 [2020-10-14 20:53:22,521 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:22,521 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:22,522 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:22,522 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 96 [2020-10-14 20:53:22,522 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:22,522 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 20 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-14 20:53:22,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1922694880] [2020-10-14 20:53:22,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:22,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:53:22,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758647213] [2020-10-14 20:53:22,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:53:22,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:22,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:53:22,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:22,610 INFO L87 Difference]: Start difference. First operand 594 states and 711 transitions. Second operand 7 states. [2020-10-14 20:53:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:23,789 INFO L93 Difference]: Finished difference Result 1345 states and 1610 transitions. [2020-10-14 20:53:23,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-14 20:53:23,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2020-10-14 20:53:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:23,797 INFO L225 Difference]: With dead ends: 1345 [2020-10-14 20:53:23,798 INFO L226 Difference]: Without dead ends: 757 [2020-10-14 20:53:23,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-14 20:53:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2020-10-14 20:53:23,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 743. [2020-10-14 20:53:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2020-10-14 20:53:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 877 transitions. [2020-10-14 20:53:23,825 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 877 transitions. Word has length 192 [2020-10-14 20:53:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:23,825 INFO L479 AbstractCegarLoop]: Abstraction has 743 states and 877 transitions. [2020-10-14 20:53:23,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:53:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 877 transitions. [2020-10-14 20:53:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-14 20:53:23,829 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:23,829 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-10-14 20:53:23,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-14 20:53:23,829 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash 391993621, now seen corresponding path program 1 times [2020-10-14 20:53:23,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:23,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [485080100] [2020-10-14 20:53:23,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:23,915 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:24,064 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:24,219 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:24,748 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:24,748 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 206 [2020-10-14 20:53:24,748 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 20:53:24,749 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 853 [2020-10-14 20:53:24,749 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:24,749 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:24,749 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:24,750 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 20:53:24,750 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 101 [2020-10-14 20:53:24,750 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:24,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:24,804 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:24,806 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:24,807 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:24,807 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:24,807 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 20:53:24,807 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:24,807 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:24,808 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:24,808 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:24,808 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:24,808 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:24,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:24,842 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:24,898 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:24,899 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 20:53:24,899 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:24,899 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 66 [2020-10-14 20:53:24,899 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:24,899 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:24,900 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:24,900 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:24,900 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 20:53:24,900 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:24,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-14 20:53:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:24,966 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:25,105 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:25,106 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-14 20:53:25,106 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:25,106 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 154 [2020-10-14 20:53:25,106 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:25,107 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:25,107 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:25,107 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:53:25,107 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-14 20:53:25,108 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 20:53:25,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [485080100] [2020-10-14 20:53:25,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:25,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:53:25,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184542764] [2020-10-14 20:53:25,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:53:25,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:53:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:25,209 INFO L87 Difference]: Start difference. First operand 743 states and 877 transitions. Second operand 7 states. [2020-10-14 20:53:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:26,699 INFO L93 Difference]: Finished difference Result 1510 states and 1863 transitions. [2020-10-14 20:53:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 20:53:26,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2020-10-14 20:53:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:26,707 INFO L225 Difference]: With dead ends: 1510 [2020-10-14 20:53:26,707 INFO L226 Difference]: Without dead ends: 916 [2020-10-14 20:53:26,709 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-14 20:53:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2020-10-14 20:53:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 894. [2020-10-14 20:53:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-10-14 20:53:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1073 transitions. [2020-10-14 20:53:26,737 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1073 transitions. Word has length 194 [2020-10-14 20:53:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:26,738 INFO L479 AbstractCegarLoop]: Abstraction has 894 states and 1073 transitions. [2020-10-14 20:53:26,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:53:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1073 transitions. [2020-10-14 20:53:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-10-14 20:53:26,741 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:26,742 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:53:26,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-14 20:53:26,742 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:26,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2082694709, now seen corresponding path program 1 times [2020-10-14 20:53:26,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:26,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1743060631] [2020-10-14 20:53:26,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:26,786 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:27,063 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:27,200 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:28,719 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:28,720 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 222 [2020-10-14 20:53:28,720 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 20:53:28,720 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1948 [2020-10-14 20:53:28,720 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:28,720 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:28,721 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:28,721 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105 [2020-10-14 20:53:28,721 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 101 [2020-10-14 20:53:28,721 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:28,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:28,785 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:28,787 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:28,787 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:28,787 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:28,787 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 20:53:28,788 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:28,788 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:28,788 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:28,788 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:28,788 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:28,789 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:28,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:28,835 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:28,885 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:28,885 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 96 [2020-10-14 20:53:28,885 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:28,885 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 72 [2020-10-14 20:53:28,885 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:28,886 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:28,886 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:28,886 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:28,886 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 90 [2020-10-14 20:53:28,886 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:28,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-10-14 20:53:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:28,939 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:29,048 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:29,049 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-14 20:53:29,049 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:29,049 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 121 [2020-10-14 20:53:29,049 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:29,050 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:29,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:29,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:53:29,050 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-14 20:53:29,050 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 20:53:29,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1743060631] [2020-10-14 20:53:29,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:29,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:53:29,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068609512] [2020-10-14 20:53:29,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:53:29,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:29,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:53:29,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:29,209 INFO L87 Difference]: Start difference. First operand 894 states and 1073 transitions. Second operand 7 states. [2020-10-14 20:53:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:30,609 INFO L93 Difference]: Finished difference Result 1820 states and 2311 transitions. [2020-10-14 20:53:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-14 20:53:30,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2020-10-14 20:53:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:30,617 INFO L225 Difference]: With dead ends: 1820 [2020-10-14 20:53:30,617 INFO L226 Difference]: Without dead ends: 1075 [2020-10-14 20:53:30,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-14 20:53:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2020-10-14 20:53:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1047. [2020-10-14 20:53:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2020-10-14 20:53:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1247 transitions. [2020-10-14 20:53:30,657 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1247 transitions. Word has length 210 [2020-10-14 20:53:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:30,657 INFO L479 AbstractCegarLoop]: Abstraction has 1047 states and 1247 transitions. [2020-10-14 20:53:30,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:53:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1247 transitions. [2020-10-14 20:53:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-10-14 20:53:30,662 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:30,662 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 20:53:30,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-14 20:53:30,663 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash 473377697, now seen corresponding path program 1 times [2020-10-14 20:53:30,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:30,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [909034833] [2020-10-14 20:53:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:30,712 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:30,889 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:31,152 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:31,153 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 228 [2020-10-14 20:53:31,153 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:53:31,153 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 458 [2020-10-14 20:53:31,153 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:31,154 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:31,154 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:31,154 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 20:53:31,154 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 123 [2020-10-14 20:53:31,154 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:31,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:31,214 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:31,216 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:31,216 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:31,217 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:31,218 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 20:53:31,218 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:31,219 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:31,219 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:31,219 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:31,219 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:31,219 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:31,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:31,254 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:31,325 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:31,325 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 20:53:31,325 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:31,326 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 80 [2020-10-14 20:53:31,326 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:31,326 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:31,326 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:31,327 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:31,327 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 20:53:31,327 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:31,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-14 20:53:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:31,383 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:31,583 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:31,583 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-10-14 20:53:31,584 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:31,584 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 214 [2020-10-14 20:53:31,584 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:31,585 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:31,585 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:31,585 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:53:31,586 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 121 [2020-10-14 20:53:31,586 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 20:53:31,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [909034833] [2020-10-14 20:53:31,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:31,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:53:31,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458559484] [2020-10-14 20:53:31,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:53:31,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:31,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:53:31,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:31,898 INFO L87 Difference]: Start difference. First operand 1047 states and 1247 transitions. Second operand 7 states. [2020-10-14 20:53:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:33,546 INFO L93 Difference]: Finished difference Result 2575 states and 3161 transitions. [2020-10-14 20:53:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-14 20:53:33,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2020-10-14 20:53:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:33,555 INFO L225 Difference]: With dead ends: 2575 [2020-10-14 20:53:33,555 INFO L226 Difference]: Without dead ends: 1089 [2020-10-14 20:53:33,560 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-14 20:53:33,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2020-10-14 20:53:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1053. [2020-10-14 20:53:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2020-10-14 20:53:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1229 transitions. [2020-10-14 20:53:33,603 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1229 transitions. Word has length 216 [2020-10-14 20:53:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:33,604 INFO L479 AbstractCegarLoop]: Abstraction has 1053 states and 1229 transitions. [2020-10-14 20:53:33,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:53:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1229 transitions. [2020-10-14 20:53:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-10-14 20:53:33,609 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:33,609 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:53:33,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-14 20:53:33,610 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash -378109143, now seen corresponding path program 1 times [2020-10-14 20:53:33,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:33,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1935597944] [2020-10-14 20:53:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:33,725 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:33,801 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:34,662 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:34,663 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 264 [2020-10-14 20:53:34,663 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:53:34,663 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 978 [2020-10-14 20:53:34,664 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:34,664 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:34,664 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-14 20:53:34,665 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:53:34,665 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 243 [2020-10-14 20:53:34,665 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:34,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:34,742 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:34,757 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:34,757 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:34,757 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:34,757 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 15 [2020-10-14 20:53:34,757 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:34,758 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:34,758 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:34,758 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:34,758 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:53:34,758 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:34,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:34,802 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:34,855 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:34,993 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:34,993 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-14 20:53:34,993 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:53:34,993 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 203 [2020-10-14 20:53:34,994 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:34,994 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:34,994 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:34,994 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:34,994 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-14 20:53:34,995 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:35,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-14 20:53:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:35,086 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:35,278 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:35,279 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-10-14 20:53:35,279 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:35,280 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 210 [2020-10-14 20:53:35,281 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:35,281 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:35,281 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:35,282 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:53:35,282 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 121 [2020-10-14 20:53:35,282 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 20:53:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-14 20:53:35,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1935597944] [2020-10-14 20:53:35,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:35,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:53:35,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304566037] [2020-10-14 20:53:35,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:53:35,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:35,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:53:35,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:53:35,480 INFO L87 Difference]: Start difference. First operand 1053 states and 1229 transitions. Second operand 7 states. [2020-10-14 20:53:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:37,068 INFO L93 Difference]: Finished difference Result 2289 states and 2773 transitions. [2020-10-14 20:53:37,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-14 20:53:37,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 252 [2020-10-14 20:53:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:37,079 INFO L225 Difference]: With dead ends: 2289 [2020-10-14 20:53:37,080 INFO L226 Difference]: Without dead ends: 1385 [2020-10-14 20:53:37,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-14 20:53:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-10-14 20:53:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1351. [2020-10-14 20:53:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2020-10-14 20:53:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1525 transitions. [2020-10-14 20:53:37,133 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1525 transitions. Word has length 252 [2020-10-14 20:53:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:37,134 INFO L479 AbstractCegarLoop]: Abstraction has 1351 states and 1525 transitions. [2020-10-14 20:53:37,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:53:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1525 transitions. [2020-10-14 20:53:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2020-10-14 20:53:37,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:37,147 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-14 20:53:37,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-14 20:53:37,148 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:37,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:37,149 INFO L82 PathProgramCache]: Analyzing trace with hash 332571206, now seen corresponding path program 1 times [2020-10-14 20:53:37,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:37,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2106347673] [2020-10-14 20:53:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:37,314 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:37,631 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:38,515 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:38,515 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 321 [2020-10-14 20:53:38,516 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:53:38,516 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1258 [2020-10-14 20:53:38,516 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:38,516 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:38,516 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:38,516 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-14 20:53:38,517 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-14 20:53:38,517 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:38,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:38,581 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:38,582 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:38,583 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:38,583 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:38,583 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 20:53:38,583 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:38,583 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:38,583 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:38,584 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:38,584 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:38,584 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:38,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:38,631 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:38,698 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:38,698 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-14 20:53:38,699 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:38,699 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 82 [2020-10-14 20:53:38,699 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:38,699 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:38,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:38,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:38,700 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-14 20:53:38,700 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:38,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-14 20:53:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:38,774 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:38,875 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:38,875 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 20:53:38,876 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:38,876 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 109 [2020-10-14 20:53:38,876 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:38,877 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:38,877 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:38,877 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:53:38,878 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-14 20:53:38,878 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:38,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2020-10-14 20:53:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:39,016 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:39,068 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:39,068 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-14 20:53:39,069 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:39,069 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 67 [2020-10-14 20:53:39,069 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:39,070 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:39,070 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:39,070 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 96 [2020-10-14 20:53:39,071 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:39,071 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 108 proven. 76 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-10-14 20:53:39,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2106347673] [2020-10-14 20:53:39,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:39,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-14 20:53:39,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882998811] [2020-10-14 20:53:39,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-14 20:53:39,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:39,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-14 20:53:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-14 20:53:39,431 INFO L87 Difference]: Start difference. First operand 1351 states and 1525 transitions. Second operand 8 states. [2020-10-14 20:53:41,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:41,472 INFO L93 Difference]: Finished difference Result 3155 states and 3660 transitions. [2020-10-14 20:53:41,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 20:53:41,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 307 [2020-10-14 20:53:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:41,482 INFO L225 Difference]: With dead ends: 3155 [2020-10-14 20:53:41,482 INFO L226 Difference]: Without dead ends: 1953 [2020-10-14 20:53:41,486 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-14 20:53:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2020-10-14 20:53:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1945. [2020-10-14 20:53:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2020-10-14 20:53:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2188 transitions. [2020-10-14 20:53:41,541 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2188 transitions. Word has length 307 [2020-10-14 20:53:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:41,541 INFO L479 AbstractCegarLoop]: Abstraction has 1945 states and 2188 transitions. [2020-10-14 20:53:41,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-14 20:53:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2188 transitions. [2020-10-14 20:53:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2020-10-14 20:53:41,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:41,550 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2020-10-14 20:53:41,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-14 20:53:41,550 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:41,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1830285813, now seen corresponding path program 1 times [2020-10-14 20:53:41,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:41,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804525091] [2020-10-14 20:53:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:41,670 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:42,070 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:42,071 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 340 [2020-10-14 20:53:42,071 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:42,071 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 458 [2020-10-14 20:53:42,071 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:42,072 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:42,072 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:53:42,072 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 323 [2020-10-14 20:53:42,073 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 16 [2020-10-14 20:53:42,073 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:42,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:53:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:42,162 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:42,166 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:42,167 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:53:42,167 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:42,167 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-14 20:53:42,167 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:42,168 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:42,168 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:42,168 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:42,168 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:42,169 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:42,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:53:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:42,189 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:42,281 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:42,282 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 135 [2020-10-14 20:53:42,282 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:42,282 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 93 [2020-10-14 20:53:42,282 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:42,283 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:42,283 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:42,283 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:42,283 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:42,283 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:42,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-14 20:53:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:42,325 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:42,342 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:42,343 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 20:53:42,343 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:42,343 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 18 [2020-10-14 20:53:42,343 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:42,343 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:42,343 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:53:42,344 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:42,344 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:53:42,344 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:53:42,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-10-14 20:53:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:53:42,387 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:53:42,440 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:53:42,441 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-14 20:53:42,441 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:53:42,441 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 63 [2020-10-14 20:53:42,441 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:53:42,442 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:53:42,442 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:53:42,442 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:53:42,442 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-14 20:53:42,442 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:53:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2020-10-14 20:53:42,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804525091] [2020-10-14 20:53:42,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:53:42,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 20:53:42,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244333094] [2020-10-14 20:53:42,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 20:53:42,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:53:42,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 20:53:42,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 20:53:42,584 INFO L87 Difference]: Start difference. First operand 1945 states and 2188 transitions. Second operand 5 states. [2020-10-14 20:53:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:53:43,875 INFO L93 Difference]: Finished difference Result 4760 states and 5444 transitions. [2020-10-14 20:53:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 20:53:43,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 326 [2020-10-14 20:53:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:53:43,894 INFO L225 Difference]: With dead ends: 4760 [2020-10-14 20:53:43,894 INFO L226 Difference]: Without dead ends: 2964 [2020-10-14 20:53:43,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-10-14 20:53:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-10-14 20:53:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2531. [2020-10-14 20:53:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2531 states. [2020-10-14 20:53:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 2915 transitions. [2020-10-14 20:53:43,970 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 2915 transitions. Word has length 326 [2020-10-14 20:53:43,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:53:43,971 INFO L479 AbstractCegarLoop]: Abstraction has 2531 states and 2915 transitions. [2020-10-14 20:53:43,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 20:53:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 2915 transitions. [2020-10-14 20:53:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2020-10-14 20:53:43,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:53:43,980 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 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] [2020-10-14 20:53:43,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-14 20:53:43,981 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:53:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:53:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1654194082, now seen corresponding path program 1 times [2020-10-14 20:53:43,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:53:43,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [849658989] [2020-10-14 20:53:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:53:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-14 20:53:44,063 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-14 20:53:44,063 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-14 20:53:44,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-14 20:53:44,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:53:44 BoogieIcfgContainer [2020-10-14 20:53:44,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-14 20:53:44,117 INFO L168 Benchmark]: Toolchain (without parser) took 34386.33 ms. Allocated memory was 147.3 MB in the beginning and 719.3 MB in the end (delta: 572.0 MB). Free memory was 102.5 MB in the beginning and 212.4 MB in the end (delta: -110.0 MB). Peak memory consumption was 462.0 MB. Max. memory is 7.1 GB. [2020-10-14 20:53:44,118 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 121.9 MB in the beginning and 121.5 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-14 20:53:44,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.18 ms. Allocated memory was 147.3 MB in the beginning and 206.6 MB in the end (delta: 59.2 MB). Free memory was 102.0 MB in the beginning and 170.0 MB in the end (delta: -67.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2020-10-14 20:53:44,120 INFO L168 Benchmark]: Boogie Preprocessor took 136.17 ms. Allocated memory is still 206.6 MB. Free memory was 170.0 MB in the beginning and 165.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-10-14 20:53:44,121 INFO L168 Benchmark]: RCFGBuilder took 1491.03 ms. Allocated memory was 206.6 MB in the beginning and 237.0 MB in the end (delta: 30.4 MB). Free memory was 165.9 MB in the beginning and 177.0 MB in the end (delta: -11.0 MB). Peak memory consumption was 78.9 MB. Max. memory is 7.1 GB. [2020-10-14 20:53:44,121 INFO L168 Benchmark]: TraceAbstraction took 31991.59 ms. Allocated memory was 237.0 MB in the beginning and 719.3 MB in the end (delta: 482.3 MB). Free memory was 177.0 MB in the beginning and 212.4 MB in the end (delta: -35.5 MB). Peak memory consumption was 446.9 MB. Max. memory is 7.1 GB. [2020-10-14 20:53:44,126 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 121.9 MB in the beginning and 121.5 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.18 ms. Allocated memory was 147.3 MB in the beginning and 206.6 MB in the end (delta: 59.2 MB). Free memory was 102.0 MB in the beginning and 170.0 MB in the end (delta: -67.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.17 ms. Allocated memory is still 206.6 MB. Free memory was 170.0 MB in the beginning and 165.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1491.03 ms. Allocated memory was 206.6 MB in the beginning and 237.0 MB in the end (delta: 30.4 MB). Free memory was 165.9 MB in the beginning and 177.0 MB in the end (delta: -11.0 MB). Peak memory consumption was 78.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31991.59 ms. Allocated memory was 237.0 MB in the beginning and 719.3 MB in the end (delta: 482.3 MB). Free memory was 177.0 MB in the beginning and 212.4 MB in the end (delta: -35.5 MB). Peak memory consumption was 446.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: 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 TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L455] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L456] a10 = 2 [L457] a19 = 7 [L459] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) [L37] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.8s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 289 SDtfs, 4182 SDslu, 361 SDs, 0 SdLazy, 9829 SolverSat, 1564 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2531occurred in iteration=10, 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, 10 MinimizatonAttempts, 1181 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 2323 NumberOfCodeBlocks, 2323 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1976 ConstructedInterpolants, 0 QuantifiedInterpolants, 1207089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 1047/1209 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...