/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_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-14 20:54:26,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-14 20:54:26,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-14 20:54:26,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-14 20:54:26,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-14 20:54:26,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-14 20:54:26,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-14 20:54:26,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-14 20:54:26,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-14 20:54:26,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-14 20:54:26,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-14 20:54:26,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-14 20:54:26,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-14 20:54:26,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-14 20:54:26,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-14 20:54:26,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-14 20:54:26,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-14 20:54:26,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-14 20:54:26,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-14 20:54:26,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-14 20:54:26,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-14 20:54:26,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-14 20:54:26,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-14 20:54:26,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-14 20:54:26,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-14 20:54:26,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-14 20:54:26,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-14 20:54:26,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-14 20:54:26,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-14 20:54:26,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-14 20:54:26,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-14 20:54:26,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-14 20:54:26,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-14 20:54:26,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-14 20:54:26,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-14 20:54:26,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-14 20:54:26,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-14 20:54:26,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-14 20:54:26,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-14 20:54:26,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-14 20:54:26,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-14 20:54:26,615 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:54:26,646 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-14 20:54:26,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-14 20:54:26,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-14 20:54:26,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-14 20:54:26,648 INFO L138 SettingsManager]: * Use SBE=true [2020-10-14 20:54:26,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-14 20:54:26,648 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-14 20:54:26,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-14 20:54:26,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-14 20:54:26,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-14 20:54:26,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-14 20:54:26,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-14 20:54:26,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-14 20:54:26,652 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-14 20:54:26,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-14 20:54:26,653 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-14 20:54:26,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-14 20:54:26,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-14 20:54:26,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-14 20:54:26,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-14 20:54:26,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-14 20:54:26,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-14 20:54:26,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-14 20:54:26,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-14 20:54:26,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-14 20:54:26,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-14 20:54:26,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-14 20:54:26,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-14 20:54:26,656 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-14 20:54:26,656 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:54:26,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-14 20:54:26,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-14 20:54:26,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-14 20:54:26,981 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-14 20:54:26,982 INFO L275 PluginConnector]: CDTParser initialized [2020-10-14 20:54:26,982 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-10-14 20:54:27,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ee31fdee1/f623740962754e768c9a6e7c226ac1d2/FLAG5aa0ac3c0 [2020-10-14 20:54:27,526 INFO L306 CDTParser]: Found 1 translation units. [2020-10-14 20:54:27,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-10-14 20:54:27,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ee31fdee1/f623740962754e768c9a6e7c226ac1d2/FLAG5aa0ac3c0 [2020-10-14 20:54:27,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ee31fdee1/f623740962754e768c9a6e7c226ac1d2 [2020-10-14 20:54:27,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-14 20:54:27,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-14 20:54:27,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-14 20:54:27,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-14 20:54:27,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-14 20:54:27,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:54:27" (1/1) ... [2020-10-14 20:54:27,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729acd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:27, skipping insertion in model container [2020-10-14 20:54:27,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:54:27" (1/1) ... [2020-10-14 20:54:27,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-14 20:54:27,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-14 20:54:28,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 20:54:28,487 INFO L203 MainTranslator]: Completed pre-run [2020-10-14 20:54:28,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 20:54:28,616 INFO L208 MainTranslator]: Completed translation [2020-10-14 20:54:28,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:28 WrapperNode [2020-10-14 20:54:28,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-14 20:54:28,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-14 20:54:28,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-14 20:54:28,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-14 20:54:28,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:28" (1/1) ... [2020-10-14 20:54:28,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:28" (1/1) ... [2020-10-14 20:54:28,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:28" (1/1) ... [2020-10-14 20:54:28,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:28" (1/1) ... [2020-10-14 20:54:28,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:28" (1/1) ... [2020-10-14 20:54:28,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:28" (1/1) ... [2020-10-14 20:54:28,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:28" (1/1) ... [2020-10-14 20:54:28,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-14 20:54:28,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-14 20:54:28,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-14 20:54:28,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-14 20:54:28,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:28" (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:54:28,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-14 20:54:28,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-14 20:54:28,799 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-14 20:54:28,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-14 20:54:28,800 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-14 20:54:28,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-14 20:54:28,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-14 20:54:28,801 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-14 20:54:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-14 20:54:28,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-14 20:54:28,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-14 20:54:30,085 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-14 20:54:30,086 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-14 20:54:30,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:54:30 BoogieIcfgContainer [2020-10-14 20:54:30,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-14 20:54:30,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-14 20:54:30,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-14 20:54:30,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-14 20:54:30,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:54:27" (1/3) ... [2020-10-14 20:54:30,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab4936b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:54:30, skipping insertion in model container [2020-10-14 20:54:30,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:54:28" (2/3) ... [2020-10-14 20:54:30,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab4936b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:54:30, skipping insertion in model container [2020-10-14 20:54:30,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:54:30" (3/3) ... [2020-10-14 20:54:30,106 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-10-14 20:54:30,116 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-14 20:54:30,125 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-14 20:54:30,139 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-14 20:54:30,171 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-14 20:54:30,172 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-14 20:54:30,172 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-14 20:54:30,172 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-14 20:54:30,172 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-14 20:54:30,172 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-14 20:54:30,173 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-14 20:54:30,173 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-14 20:54:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-14 20:54:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-14 20:54:30,205 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:30,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:54:30,206 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1305395761, now seen corresponding path program 1 times [2020-10-14 20:54:30,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:30,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1011406595] [2020-10-14 20:54:30,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:30,374 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:30,632 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:30,633 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 32 [2020-10-14 20:54:30,633 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:30,633 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 289 [2020-10-14 20:54:30,635 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:30,636 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:30,636 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 20:54:30,636 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:54:30,636 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-14 20:54:30,637 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 20:54:30,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:30,726 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:30,733 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:30,733 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:30,734 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:30,734 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-14 20:54:30,734 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:30,734 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:30,735 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:30,735 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:30,735 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:54:30,735 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:30,745 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:54:30,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1011406595] [2020-10-14 20:54:30,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 20:54:30,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-14 20:54:30,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996795063] [2020-10-14 20:54:30,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-14 20:54:30,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:30,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-14 20:54:30,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-14 20:54:30,770 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-10-14 20:54:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:32,102 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2020-10-14 20:54:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 20:54:32,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-14 20:54:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:32,131 INFO L225 Difference]: With dead ends: 581 [2020-10-14 20:54:32,132 INFO L226 Difference]: Without dead ends: 302 [2020-10-14 20:54:32,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-14 20:54:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-14 20:54:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2020-10-14 20:54:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-14 20:54:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2020-10-14 20:54:32,234 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 24 [2020-10-14 20:54:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:32,234 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2020-10-14 20:54:32,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-14 20:54:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2020-10-14 20:54:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-14 20:54:32,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:32,240 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:54:32,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-14 20:54:32,240 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:32,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:32,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1317266958, now seen corresponding path program 1 times [2020-10-14 20:54:32,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:32,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613110803] [2020-10-14 20:54:32,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:32,303 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:32,496 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:32,996 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:33,126 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:33,126 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 106 [2020-10-14 20:54:33,126 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 20:54:33,127 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 846 [2020-10-14 20:54:33,128 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:33,128 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:33,129 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-14 20:54:33,130 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:54:33,130 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 100 [2020-10-14 20:54:33,130 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 20:54:33,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:33,202 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:33,208 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:33,209 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:33,213 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:33,213 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-14 20:54:33,213 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:33,214 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:33,214 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:33,214 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:33,214 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:54:33,215 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:33,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:33,277 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:33,338 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:33,429 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:33,429 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-14 20:54:33,430 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:54:33,430 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 161 [2020-10-14 20:54:33,430 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:33,439 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:33,440 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:33,440 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:33,440 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-14 20:54:33,441 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 10 [2020-10-14 20:54:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-14 20:54:33,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613110803] [2020-10-14 20:54:33,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:54:33,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-14 20:54:33,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525351060] [2020-10-14 20:54:33,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:54:33,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:33,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:54:33,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:54:33,565 INFO L87 Difference]: Start difference. First operand 296 states and 423 transitions. Second operand 7 states. [2020-10-14 20:54:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:34,770 INFO L93 Difference]: Finished difference Result 741 states and 1054 transitions. [2020-10-14 20:54:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-14 20:54:34,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2020-10-14 20:54:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:34,776 INFO L225 Difference]: With dead ends: 741 [2020-10-14 20:54:34,776 INFO L226 Difference]: Without dead ends: 451 [2020-10-14 20:54:34,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-14 20:54:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2020-10-14 20:54:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 445. [2020-10-14 20:54:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-10-14 20:54:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 601 transitions. [2020-10-14 20:54:34,818 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 601 transitions. Word has length 96 [2020-10-14 20:54:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:34,819 INFO L479 AbstractCegarLoop]: Abstraction has 445 states and 601 transitions. [2020-10-14 20:54:34,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 601 transitions. [2020-10-14 20:54:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-14 20:54:34,823 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:34,823 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:54:34,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-14 20:54:34,824 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash -689374291, now seen corresponding path program 1 times [2020-10-14 20:54:34,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:34,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [277432955] [2020-10-14 20:54:34,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:34,883 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:35,100 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:35,100 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-10-14 20:54:35,101 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:35,101 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 239 [2020-10-14 20:54:35,101 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:35,101 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:35,102 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:35,102 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 20:54:35,102 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-10-14 20:54:35,102 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:35,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:35,163 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:35,166 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:35,167 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:35,167 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:35,167 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 20:54:35,168 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:35,168 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:35,168 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:35,169 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:35,169 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:35,170 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:35,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:35,222 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:35,304 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:35,304 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 20:54:35,305 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:35,305 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 99 [2020-10-14 20:54:35,306 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:35,306 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:35,306 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:35,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:35,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 20:54:35,307 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:54:35,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [277432955] [2020-10-14 20:54:35,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:54:35,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 20:54:35,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407331582] [2020-10-14 20:54:35,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 20:54:35,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 20:54:35,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 20:54:35,354 INFO L87 Difference]: Start difference. First operand 445 states and 601 transitions. Second operand 5 states. [2020-10-14 20:54:36,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:36,403 INFO L93 Difference]: Finished difference Result 1039 states and 1486 transitions. [2020-10-14 20:54:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 20:54:36,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2020-10-14 20:54:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:36,409 INFO L225 Difference]: With dead ends: 1039 [2020-10-14 20:54:36,409 INFO L226 Difference]: Without dead ends: 743 [2020-10-14 20:54:36,410 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-14 20:54:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2020-10-14 20:54:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2020-10-14 20:54:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2020-10-14 20:54:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 975 transitions. [2020-10-14 20:54:36,449 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 975 transitions. Word has length 103 [2020-10-14 20:54:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:36,450 INFO L479 AbstractCegarLoop]: Abstraction has 743 states and 975 transitions. [2020-10-14 20:54:36,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 20:54:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 975 transitions. [2020-10-14 20:54:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-10-14 20:54:36,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:36,457 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:36,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-14 20:54:36,458 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash -761339506, now seen corresponding path program 1 times [2020-10-14 20:54:36,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:36,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [409194970] [2020-10-14 20:54:36,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:36,530 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:36,723 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:37,439 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:37,440 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 170 [2020-10-14 20:54:37,440 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 20:54:37,441 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 938 [2020-10-14 20:54:37,441 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:37,441 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:37,442 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 20:54:37,442 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 20:54:37,442 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-14 20:54:37,442 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:37,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:37,509 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:37,517 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:37,519 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:37,519 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:37,519 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-10-14 20:54:37,520 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:37,520 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:37,521 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:37,521 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:37,521 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 20:54:37,522 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:37,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:37,598 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:37,771 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:37,772 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-14 20:54:37,772 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:37,772 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 197 [2020-10-14 20:54:37,772 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:37,773 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:37,773 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:37,773 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:37,774 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-14 20:54:37,774 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 20:54:37,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [409194970] [2020-10-14 20:54:37,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 20:54:37,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-14 20:54:37,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159401561] [2020-10-14 20:54:37,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-14 20:54:37,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-14 20:54:37,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-14 20:54:37,956 INFO L87 Difference]: Start difference. First operand 743 states and 975 transitions. Second operand 8 states. [2020-10-14 20:54:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:39,771 INFO L93 Difference]: Finished difference Result 1671 states and 2275 transitions. [2020-10-14 20:54:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-14 20:54:39,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 160 [2020-10-14 20:54:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:39,781 INFO L225 Difference]: With dead ends: 1671 [2020-10-14 20:54:39,782 INFO L226 Difference]: Without dead ends: 1077 [2020-10-14 20:54:39,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-10-14 20:54:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2020-10-14 20:54:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1053. [2020-10-14 20:54:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2020-10-14 20:54:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1291 transitions. [2020-10-14 20:54:39,842 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1291 transitions. Word has length 160 [2020-10-14 20:54:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:39,844 INFO L479 AbstractCegarLoop]: Abstraction has 1053 states and 1291 transitions. [2020-10-14 20:54:39,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-14 20:54:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1291 transitions. [2020-10-14 20:54:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-10-14 20:54:39,853 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:39,854 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 20:54:39,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-14 20:54:39,854 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -102176325, now seen corresponding path program 1 times [2020-10-14 20:54:39,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:39,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1628464374] [2020-10-14 20:54:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:39,919 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:40,044 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:40,306 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:40,555 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:40,768 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:40,769 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 188 [2020-10-14 20:54:40,769 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-14 20:54:40,769 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 873 [2020-10-14 20:54:40,769 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:40,769 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:40,770 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:40,770 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 20:54:40,770 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-14 20:54:40,770 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:40,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:40,826 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:40,828 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:40,829 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:40,829 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:40,829 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 20:54:40,829 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:40,829 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:40,830 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:40,830 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:40,830 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:40,830 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:40,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:40,862 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:40,904 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:40,904 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 20:54:40,905 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:40,905 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 50 [2020-10-14 20:54:40,905 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:40,905 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:40,906 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:40,906 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:40,906 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 20:54:40,906 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:40,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-14 20:54:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:40,946 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:41,034 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:41,034 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-14 20:54:41,034 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:41,035 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 96 [2020-10-14 20:54:41,035 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:41,035 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:41,035 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:41,036 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:41,036 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 20:54:41,036 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 104 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 20:54:41,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1628464374] [2020-10-14 20:54:41,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:54:41,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:54:41,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084393952] [2020-10-14 20:54:41,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:54:41,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:41,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:54:41,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:54:41,146 INFO L87 Difference]: Start difference. First operand 1053 states and 1291 transitions. Second operand 7 states. [2020-10-14 20:54:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:42,649 INFO L93 Difference]: Finished difference Result 2277 states and 2870 transitions. [2020-10-14 20:54:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 20:54:42,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 176 [2020-10-14 20:54:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:42,663 INFO L225 Difference]: With dead ends: 2277 [2020-10-14 20:54:42,664 INFO L226 Difference]: Without dead ends: 1073 [2020-10-14 20:54:42,667 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-14 20:54:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2020-10-14 20:54:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1047. [2020-10-14 20:54:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2020-10-14 20:54:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1198 transitions. [2020-10-14 20:54:42,709 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1198 transitions. Word has length 176 [2020-10-14 20:54:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:42,709 INFO L479 AbstractCegarLoop]: Abstraction has 1047 states and 1198 transitions. [2020-10-14 20:54:42,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1198 transitions. [2020-10-14 20:54:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-14 20:54:42,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:42,715 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:54:42,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-14 20:54:42,715 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:42,716 INFO L82 PathProgramCache]: Analyzing trace with hash 570689389, now seen corresponding path program 1 times [2020-10-14 20:54:42,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:42,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408932827] [2020-10-14 20:54:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:42,790 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:42,916 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:43,082 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:43,191 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:43,888 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:43,888 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 196 [2020-10-14 20:54:43,888 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-14 20:54:43,888 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1134 [2020-10-14 20:54:43,889 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:43,889 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:43,889 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:43,889 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-14 20:54:43,889 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-14 20:54:43,889 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:43,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:43,948 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:43,950 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:43,951 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:43,951 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:43,951 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 20:54:43,951 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:43,951 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:43,952 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:43,952 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:43,952 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:43,952 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:43,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:43,981 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:44,018 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:44,018 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 20:54:44,018 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:44,018 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 43 [2020-10-14 20:54:44,019 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:44,019 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:44,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:44,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:44,020 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-14 20:54:44,020 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:44,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-14 20:54:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:44,057 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:44,135 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:44,135 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-14 20:54:44,136 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:44,136 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 87 [2020-10-14 20:54:44,136 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:44,136 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:44,137 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:44,137 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:44,137 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-14 20:54:44,137 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 20:54:44,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408932827] [2020-10-14 20:54:44,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:54:44,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:54:44,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20508195] [2020-10-14 20:54:44,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:54:44,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:44,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:54:44,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:54:44,217 INFO L87 Difference]: Start difference. First operand 1047 states and 1198 transitions. Second operand 7 states. [2020-10-14 20:54:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:45,422 INFO L93 Difference]: Finished difference Result 2269 states and 2622 transitions. [2020-10-14 20:54:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 20:54:45,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2020-10-14 20:54:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:45,430 INFO L225 Difference]: With dead ends: 2269 [2020-10-14 20:54:45,430 INFO L226 Difference]: Without dead ends: 1218 [2020-10-14 20:54:45,432 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:54:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-10-14 20:54:45,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1194. [2020-10-14 20:54:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2020-10-14 20:54:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1361 transitions. [2020-10-14 20:54:45,477 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1361 transitions. Word has length 184 [2020-10-14 20:54:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:45,477 INFO L479 AbstractCegarLoop]: Abstraction has 1194 states and 1361 transitions. [2020-10-14 20:54:45,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1361 transitions. [2020-10-14 20:54:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-10-14 20:54:45,482 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:45,482 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-14 20:54:45,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-14 20:54:45,483 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:45,483 INFO L82 PathProgramCache]: Analyzing trace with hash -289552951, now seen corresponding path program 1 times [2020-10-14 20:54:45,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:45,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599147327] [2020-10-14 20:54:45,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:45,559 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:45,620 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:46,312 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:46,538 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:46,699 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:48,275 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:48,275 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 275 [2020-10-14 20:54:48,275 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-10-14 20:54:48,276 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2747 [2020-10-14 20:54:48,276 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:48,276 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:48,276 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:48,276 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 159 [2020-10-14 20:54:48,276 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-14 20:54:48,277 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:48,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:48,347 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:48,349 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:48,349 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:48,349 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:48,350 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 20:54:48,350 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:48,350 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:48,350 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:48,351 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:48,351 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:48,351 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:48,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:48,371 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:48,393 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:48,394 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 20:54:48,394 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:48,394 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 23 [2020-10-14 20:54:48,395 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:48,395 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:48,396 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:48,396 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:48,397 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:48,398 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 20:54:48,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-14 20:54:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:48,482 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:48,528 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:48,529 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 20:54:48,529 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:48,529 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 57 [2020-10-14 20:54:48,529 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:48,529 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:48,530 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:48,530 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:48,530 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-14 20:54:48,530 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:48,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-10-14 20:54:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:48,595 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:48,703 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:48,703 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-14 20:54:48,704 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:48,704 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 119 [2020-10-14 20:54:48,704 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:48,705 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:48,705 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:48,705 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:48,706 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-14 20:54:48,706 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-10-14 20:54:48,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599147327] [2020-10-14 20:54:48,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:54:48,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-14 20:54:48,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343662651] [2020-10-14 20:54:48,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-14 20:54:48,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:48,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-14 20:54:48,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-14 20:54:48,946 INFO L87 Difference]: Start difference. First operand 1194 states and 1361 transitions. Second operand 8 states. [2020-10-14 20:54:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:50,314 INFO L93 Difference]: Finished difference Result 2551 states and 2938 transitions. [2020-10-14 20:54:50,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-14 20:54:50,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 261 [2020-10-14 20:54:50,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:50,323 INFO L225 Difference]: With dead ends: 2551 [2020-10-14 20:54:50,324 INFO L226 Difference]: Without dead ends: 1359 [2020-10-14 20:54:50,326 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-10-14 20:54:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-10-14 20:54:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1345. [2020-10-14 20:54:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2020-10-14 20:54:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1550 transitions. [2020-10-14 20:54:50,361 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1550 transitions. Word has length 261 [2020-10-14 20:54:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:50,362 INFO L479 AbstractCegarLoop]: Abstraction has 1345 states and 1550 transitions. [2020-10-14 20:54:50,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-14 20:54:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1550 transitions. [2020-10-14 20:54:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-10-14 20:54:50,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:50,367 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-14 20:54:50,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-14 20:54:50,368 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 417056149, now seen corresponding path program 1 times [2020-10-14 20:54:50,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:50,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1280213819] [2020-10-14 20:54:50,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:50,477 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:50,736 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:50,944 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:51,265 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:52,417 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:52,418 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 285 [2020-10-14 20:54:52,418 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-14 20:54:52,418 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1999 [2020-10-14 20:54:52,418 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:52,419 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:52,419 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:52,419 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-14 20:54:52,419 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 90 [2020-10-14 20:54:52,419 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:52,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 20:54:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:52,465 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:52,466 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:52,467 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 20:54:52,467 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:52,467 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 20:54:52,467 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:52,467 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:52,467 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:52,468 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:52,468 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:52,468 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:52,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 20:54:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:52,494 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:52,529 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:52,530 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 20:54:52,530 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:52,530 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 41 [2020-10-14 20:54:52,530 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:52,530 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:52,531 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 20:54:52,531 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 20:54:52,531 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-14 20:54:52,531 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:52,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-14 20:54:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:52,569 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:52,697 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:52,698 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-14 20:54:52,698 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:52,698 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 139 [2020-10-14 20:54:52,698 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:52,698 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:52,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 20:54:52,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 20:54:52,699 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 88 [2020-10-14 20:54:52,699 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 20:54:52,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2020-10-14 20:54:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 20:54:52,775 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 20:54:52,801 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 20:54:52,802 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-14 20:54:52,802 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 20:54:52,802 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 34 [2020-10-14 20:54:52,802 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-14 20:54:52,803 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.2 [2020-10-14 20:54:52,803 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 20:54:52,803 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 88 [2020-10-14 20:54:52,803 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 20:54:52,803 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 20:54:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 122 proven. 86 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-14 20:54:52,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1280213819] [2020-10-14 20:54:52,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 20:54:52,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 20:54:52,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714694622] [2020-10-14 20:54:52,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 20:54:52,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 20:54:52,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 20:54:52,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 20:54:52,890 INFO L87 Difference]: Start difference. First operand 1345 states and 1550 transitions. Second operand 7 states. [2020-10-14 20:54:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 20:54:54,114 INFO L93 Difference]: Finished difference Result 2569 states and 3022 transitions. [2020-10-14 20:54:54,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 20:54:54,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 271 [2020-10-14 20:54:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 20:54:54,121 INFO L225 Difference]: With dead ends: 2569 [2020-10-14 20:54:54,121 INFO L226 Difference]: Without dead ends: 1373 [2020-10-14 20:54:54,124 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-14 20:54:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-10-14 20:54:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1347. [2020-10-14 20:54:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2020-10-14 20:54:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1514 transitions. [2020-10-14 20:54:54,160 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1514 transitions. Word has length 271 [2020-10-14 20:54:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 20:54:54,161 INFO L479 AbstractCegarLoop]: Abstraction has 1347 states and 1514 transitions. [2020-10-14 20:54:54,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 20:54:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1514 transitions. [2020-10-14 20:54:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-10-14 20:54:54,166 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 20:54:54,166 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:54,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-14 20:54:54,167 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 20:54:54,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 20:54:54,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1637300869, now seen corresponding path program 1 times [2020-10-14 20:54:54,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 20:54:54,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1053523509] [2020-10-14 20:54:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 20:54:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-14 20:54:54,221 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-14 20:54:54,222 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-14 20:54:54,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-14 20:54:54,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:54:54 BoogieIcfgContainer [2020-10-14 20:54:54,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-14 20:54:54,274 INFO L168 Benchmark]: Toolchain (without parser) took 26460.55 ms. Allocated memory was 146.3 MB in the beginning and 657.5 MB in the end (delta: 511.2 MB). Free memory was 99.7 MB in the beginning and 481.8 MB in the end (delta: -382.2 MB). Peak memory consumption was 129.0 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:54,274 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 146.3 MB. Free memory was 119.6 MB in the beginning and 119.2 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-14 20:54:54,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.99 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 99.3 MB in the beginning and 169.1 MB in the end (delta: -69.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:54,276 INFO L168 Benchmark]: Boogie Preprocessor took 106.76 ms. Allocated memory is still 203.9 MB. Free memory was 169.1 MB in the beginning and 165.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:54,277 INFO L168 Benchmark]: RCFGBuilder took 1370.79 ms. Allocated memory was 203.9 MB in the beginning and 238.0 MB in the end (delta: 34.1 MB). Free memory was 165.0 MB in the beginning and 180.4 MB in the end (delta: -15.3 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:54,278 INFO L168 Benchmark]: TraceAbstraction took 24172.58 ms. Allocated memory was 238.0 MB in the beginning and 657.5 MB in the end (delta: 419.4 MB). Free memory was 180.4 MB in the beginning and 481.8 MB in the end (delta: -301.5 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. [2020-10-14 20:54:54,281 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.17 ms. Allocated memory is still 146.3 MB. Free memory was 119.6 MB in the beginning and 119.2 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.99 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 99.3 MB in the beginning and 169.1 MB in the end (delta: -69.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.76 ms. Allocated memory is still 203.9 MB. Free memory was 169.1 MB in the beginning and 165.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1370.79 ms. Allocated memory was 203.9 MB in the beginning and 238.0 MB in the end (delta: 34.1 MB). Free memory was 165.0 MB in the beginning and 180.4 MB in the end (delta: -15.3 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24172.58 ms. Allocated memory was 238.0 MB in the beginning and 657.5 MB in the end (delta: 419.4 MB). Free memory was 180.4 MB in the beginning and 481.8 MB in the end (delta: -301.5 MB). Peak memory consumption was 118.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L58] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.0s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 196 SDtfs, 3539 SDslu, 274 SDs, 0 SdLazy, 6946 SolverSat, 1080 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1347occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 126 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 1555 NumberOfCodeBlocks, 1555 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1267 ConstructedInterpolants, 0 QuantifiedInterpolants, 647243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 714/808 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...