/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=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.4 --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_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-14 02:29:47,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-14 02:29:47,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-14 02:29:47,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-14 02:29:47,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-14 02:29:47,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-14 02:29:47,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-14 02:29:47,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-14 02:29:47,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-14 02:29:47,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-14 02:29:47,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-14 02:29:47,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-14 02:29:47,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-14 02:29:47,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-14 02:29:47,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-14 02:29:47,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-14 02:29:47,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-14 02:29:47,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-14 02:29:47,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-14 02:29:47,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-14 02:29:47,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-14 02:29:47,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-14 02:29:47,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-14 02:29:47,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-14 02:29:47,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-14 02:29:47,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-14 02:29:47,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-14 02:29:47,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-14 02:29:47,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-14 02:29:47,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-14 02:29:47,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-14 02:29:47,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-14 02:29:47,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-14 02:29:47,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-14 02:29:47,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-14 02:29:47,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-14 02:29:47,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-14 02:29:47,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-14 02:29:47,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-14 02:29:47,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-14 02:29:47,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-14 02:29:47,567 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 02:29:47,605 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-14 02:29:47,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-14 02:29:47,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-14 02:29:47,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-14 02:29:47,608 INFO L138 SettingsManager]: * Use SBE=true [2020-10-14 02:29:47,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-14 02:29:47,609 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-14 02:29:47,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-14 02:29:47,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-14 02:29:47,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-14 02:29:47,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-14 02:29:47,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-14 02:29:47,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-14 02:29:47,611 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-14 02:29:47,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-14 02:29:47,612 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-14 02:29:47,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-14 02:29:47,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-14 02:29:47,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-14 02:29:47,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-14 02:29:47,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-14 02:29:47,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-14 02:29:47,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-14 02:29:47,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-14 02:29:47,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-14 02:29:47,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-14 02:29:47,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-14 02:29:47,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-14 02:29:47,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-14 02:29:47,615 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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;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=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=true; [2020-10-14 02:29:47,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-14 02:29:47,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-14 02:29:47,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-14 02:29:47,973 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-14 02:29:47,973 INFO L275 PluginConnector]: CDTParser initialized [2020-10-14 02:29:47,974 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label12.c [2020-10-14 02:29:48,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b0da1ee34/9b0259add69241939f8dfb598c773d9a/FLAG0ac058a00 [2020-10-14 02:29:48,587 INFO L306 CDTParser]: Found 1 translation units. [2020-10-14 02:29:48,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label12.c [2020-10-14 02:29:48,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b0da1ee34/9b0259add69241939f8dfb598c773d9a/FLAG0ac058a00 [2020-10-14 02:29:48,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b0da1ee34/9b0259add69241939f8dfb598c773d9a [2020-10-14 02:29:48,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-14 02:29:48,872 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-14 02:29:48,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-14 02:29:48,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-14 02:29:48,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-14 02:29:48,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:29:48" (1/1) ... [2020-10-14 02:29:48,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cc86df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:48, skipping insertion in model container [2020-10-14 02:29:48,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:29:48" (1/1) ... [2020-10-14 02:29:48,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-14 02:29:48,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-14 02:29:49,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 02:29:49,352 INFO L203 MainTranslator]: Completed pre-run [2020-10-14 02:29:49,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 02:29:49,624 INFO L208 MainTranslator]: Completed translation [2020-10-14 02:29:49,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:49 WrapperNode [2020-10-14 02:29:49,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-14 02:29:49,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-14 02:29:49,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-14 02:29:49,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-14 02:29:49,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:49" (1/1) ... [2020-10-14 02:29:49,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:49" (1/1) ... [2020-10-14 02:29:49,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:49" (1/1) ... [2020-10-14 02:29:49,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:49" (1/1) ... [2020-10-14 02:29:49,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:49" (1/1) ... [2020-10-14 02:29:49,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:49" (1/1) ... [2020-10-14 02:29:49,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:49" (1/1) ... [2020-10-14 02:29:49,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-14 02:29:49,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-14 02:29:49,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-14 02:29:49,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-14 02:29:49,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:49" (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 02:29:49,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-14 02:29:49,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-14 02:29:49,802 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-14 02:29:49,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-14 02:29:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-14 02:29:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-14 02:29:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-14 02:29:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-14 02:29:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-14 02:29:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-14 02:29:49,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-14 02:29:51,068 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-14 02:29:51,069 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-14 02:29:51,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:29:51 BoogieIcfgContainer [2020-10-14 02:29:51,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-14 02:29:51,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-14 02:29:51,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-14 02:29:51,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-14 02:29:51,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:29:48" (1/3) ... [2020-10-14 02:29:51,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b099231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:29:51, skipping insertion in model container [2020-10-14 02:29:51,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:29:49" (2/3) ... [2020-10-14 02:29:51,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b099231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:29:51, skipping insertion in model container [2020-10-14 02:29:51,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:29:51" (3/3) ... [2020-10-14 02:29:51,085 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label12.c [2020-10-14 02:29:51,097 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-14 02:29:51,106 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-14 02:29:51,122 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-14 02:29:51,149 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-14 02:29:51,150 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-14 02:29:51,150 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-14 02:29:51,150 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-14 02:29:51,150 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-14 02:29:51,150 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-14 02:29:51,151 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-14 02:29:51,151 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-14 02:29:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-14 02:29:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-14 02:29:51,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:29:51,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:29:51,184 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:29:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:29:51,191 INFO L82 PathProgramCache]: Analyzing trace with hash 242271255, now seen corresponding path program 1 times [2020-10-14 02:29:51,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:29:51,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122265890] [2020-10-14 02:29:51,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:29:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:29:51,371 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:51,634 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:29:51,635 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 26 [2020-10-14 02:29:51,635 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:29:51,635 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 292 [2020-10-14 02:29:51,637 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:29:51,638 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:29:51,638 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 02:29:51,638 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 02:29:51,638 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 20 [2020-10-14 02:29:51,639 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 02:29:51,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:29:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:29:51,733 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:51,741 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:29:51,742 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:29:51,742 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:29:51,742 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-14 02:29:51,742 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:29:51,743 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:29:51,743 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:29:51,743 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:29:51,743 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 02:29:51,743 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:29:51,760 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 02:29:51,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122265890] [2020-10-14 02:29:51,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 02:29:51,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-14 02:29:51,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503893089] [2020-10-14 02:29:51,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:29:51,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:29:51,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:29:51,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:29:51,785 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-10-14 02:29:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:29:53,875 INFO L93 Difference]: Finished difference Result 730 states and 1300 transitions. [2020-10-14 02:29:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-14 02:29:53,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-14 02:29:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:29:53,916 INFO L225 Difference]: With dead ends: 730 [2020-10-14 02:29:53,916 INFO L226 Difference]: Without dead ends: 447 [2020-10-14 02:29:53,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:29:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-10-14 02:29:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2020-10-14 02:29:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-10-14 02:29:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 615 transitions. [2020-10-14 02:29:54,039 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 615 transitions. Word has length 18 [2020-10-14 02:29:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:29:54,040 INFO L479 AbstractCegarLoop]: Abstraction has 443 states and 615 transitions. [2020-10-14 02:29:54,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:29:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 615 transitions. [2020-10-14 02:29:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-14 02:29:54,045 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:29:54,045 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-14 02:29:54,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-14 02:29:54,046 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:29:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:29:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash -138419591, now seen corresponding path program 1 times [2020-10-14 02:29:54,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:29:54,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [731776114] [2020-10-14 02:29:54,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:29:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:29:54,113 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:54,172 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:54,347 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:55,629 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:29:55,630 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 105 [2020-10-14 02:29:55,630 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 02:29:55,630 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1540 [2020-10-14 02:29:55,631 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:29:55,631 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:29:55,631 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:29:55,632 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-14 02:29:55,633 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-14 02:29:55,633 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 02:29:55,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:29:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:29:55,698 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:55,699 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:29:55,700 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:29:55,702 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:29:55,703 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:29:55,703 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:29:55,703 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:29:55,703 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:29:55,704 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:29:55,704 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:29:55,704 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:29:55,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:29:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:29:55,783 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:55,850 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:29:55,850 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 02:29:55,850 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:29:55,851 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 77 [2020-10-14 02:29:55,851 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:29:55,851 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:29:55,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:29:55,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:29:55,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-14 02:29:55,860 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 8 [2020-10-14 02:29:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 02:29:55,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [731776114] [2020-10-14 02:29:55,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:29:55,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 02:29:55,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634131038] [2020-10-14 02:29:55,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:29:55,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:29:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:29:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:29:55,910 INFO L87 Difference]: Start difference. First operand 443 states and 615 transitions. Second operand 5 states. [2020-10-14 02:29:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:29:57,042 INFO L93 Difference]: Finished difference Result 1319 states and 1870 transitions. [2020-10-14 02:29:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:29:57,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-10-14 02:29:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:29:57,050 INFO L225 Difference]: With dead ends: 1319 [2020-10-14 02:29:57,050 INFO L226 Difference]: Without dead ends: 882 [2020-10-14 02:29:57,052 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 02:29:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2020-10-14 02:29:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 878. [2020-10-14 02:29:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-10-14 02:29:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1180 transitions. [2020-10-14 02:29:57,102 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1180 transitions. Word has length 95 [2020-10-14 02:29:57,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:29:57,103 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1180 transitions. [2020-10-14 02:29:57,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:29:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1180 transitions. [2020-10-14 02:29:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-10-14 02:29:57,114 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:29:57,114 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:29:57,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-14 02:29:57,115 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:29:57,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:29:57,115 INFO L82 PathProgramCache]: Analyzing trace with hash -427365918, now seen corresponding path program 1 times [2020-10-14 02:29:57,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:29:57,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1488135212] [2020-10-14 02:29:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:29:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:29:57,218 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:57,570 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:29:57,570 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 219 [2020-10-14 02:29:57,571 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:29:57,571 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 392 [2020-10-14 02:29:57,571 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:29:57,571 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:29:57,571 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:29:57,572 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-14 02:29:57,572 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-14 02:29:57,572 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:29:57,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:29:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:29:57,642 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:57,645 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:29:57,645 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:29:57,645 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:29:57,645 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:29:57,646 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:29:57,646 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:29:57,646 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:29:57,646 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:29:57,646 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:29:57,647 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:29:57,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:29:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:29:57,678 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:57,763 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:29:57,763 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 02:29:57,763 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:29:57,764 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 93 [2020-10-14 02:29:57,764 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:29:57,764 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:29:57,764 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:29:57,764 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:29:57,765 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-14 02:29:57,765 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:29:57,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-14 02:29:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:29:57,837 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:29:58,051 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:29:58,051 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-14 02:29:58,051 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:29:58,052 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 234 [2020-10-14 02:29:58,052 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:29:58,052 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:29:58,052 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:29:58,053 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:29:58,053 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-14 02:29:58,053 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:29:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:29:58,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1488135212] [2020-10-14 02:29:58,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:29:58,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:29:58,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978773925] [2020-10-14 02:29:58,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:29:58,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:29:58,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:29:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:29:58,200 INFO L87 Difference]: Start difference. First operand 878 states and 1180 transitions. Second operand 7 states. [2020-10-14 02:29:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:29:59,813 INFO L93 Difference]: Finished difference Result 2078 states and 2879 transitions. [2020-10-14 02:29:59,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 02:29:59,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 207 [2020-10-14 02:29:59,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:29:59,832 INFO L225 Difference]: With dead ends: 2078 [2020-10-14 02:29:59,832 INFO L226 Difference]: Without dead ends: 1206 [2020-10-14 02:29:59,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-14 02:29:59,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-10-14 02:29:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1043. [2020-10-14 02:29:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-10-14 02:29:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1387 transitions. [2020-10-14 02:29:59,910 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1387 transitions. Word has length 207 [2020-10-14 02:29:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:29:59,912 INFO L479 AbstractCegarLoop]: Abstraction has 1043 states and 1387 transitions. [2020-10-14 02:29:59,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:29:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1387 transitions. [2020-10-14 02:29:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-10-14 02:29:59,918 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:29:59,919 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:29:59,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-14 02:29:59,920 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:29:59,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:29:59,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1883183011, now seen corresponding path program 1 times [2020-10-14 02:29:59,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:29:59,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [90726652] [2020-10-14 02:29:59,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:29:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:29:59,992 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:00,354 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:01,477 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:01,477 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 226 [2020-10-14 02:30:01,478 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 02:30:01,478 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1511 [2020-10-14 02:30:01,478 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:01,478 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:01,478 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:01,479 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-14 02:30:01,479 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-14 02:30:01,479 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:01,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:30:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:01,556 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:01,558 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:01,559 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:30:01,559 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:01,559 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:30:01,559 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:01,560 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:01,560 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:30:01,560 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:01,560 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:30:01,560 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:01,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:30:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:01,593 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:01,649 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:01,649 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 02:30:01,649 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:01,649 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 65 [2020-10-14 02:30:01,650 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:01,650 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:01,650 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:30:01,651 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:01,651 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-14 02:30:01,651 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:01,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-14 02:30:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:01,729 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:01,944 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:01,944 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-14 02:30:01,944 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:01,946 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 236 [2020-10-14 02:30:01,946 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:01,947 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:01,947 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:01,947 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:30:01,947 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-14 02:30:01,947 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:30:02,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [90726652] [2020-10-14 02:30:02,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:30:02,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:30:02,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013019098] [2020-10-14 02:30:02,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:30:02,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:30:02,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:30:02,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:30:02,213 INFO L87 Difference]: Start difference. First operand 1043 states and 1387 transitions. Second operand 7 states. [2020-10-14 02:30:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:30:03,975 INFO L93 Difference]: Finished difference Result 2833 states and 3839 transitions. [2020-10-14 02:30:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-14 02:30:03,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 214 [2020-10-14 02:30:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:30:03,991 INFO L225 Difference]: With dead ends: 2833 [2020-10-14 02:30:03,991 INFO L226 Difference]: Without dead ends: 1796 [2020-10-14 02:30:03,995 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 02:30:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2020-10-14 02:30:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1641. [2020-10-14 02:30:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2020-10-14 02:30:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2180 transitions. [2020-10-14 02:30:04,082 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2180 transitions. Word has length 214 [2020-10-14 02:30:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:30:04,083 INFO L479 AbstractCegarLoop]: Abstraction has 1641 states and 2180 transitions. [2020-10-14 02:30:04,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:30:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2180 transitions. [2020-10-14 02:30:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-10-14 02:30:04,088 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:30:04,088 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:30:04,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-14 02:30:04,088 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:30:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:30:04,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1683218055, now seen corresponding path program 1 times [2020-10-14 02:30:04,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:30:04,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698085977] [2020-10-14 02:30:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:30:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:04,156 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:04,351 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:04,601 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:04,601 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 228 [2020-10-14 02:30:04,601 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 02:30:04,601 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 469 [2020-10-14 02:30:04,602 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:04,602 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:04,602 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:04,602 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 02:30:04,602 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-14 02:30:04,602 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:04,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:30:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:04,664 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:04,666 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:04,667 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:30:04,667 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:04,667 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:30:04,668 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:04,668 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:04,668 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:30:04,668 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:04,668 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:30:04,669 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:04,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:30:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:04,703 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:04,750 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:04,750 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 02:30:04,751 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:04,751 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 55 [2020-10-14 02:30:04,751 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:04,751 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:04,751 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:30:04,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:04,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 02:30:04,752 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:04,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-14 02:30:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:04,816 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:04,981 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:04,982 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-14 02:30:04,982 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:04,982 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 183 [2020-10-14 02:30:04,982 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:04,982 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:04,982 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:04,983 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:30:04,983 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-14 02:30:04,983 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:30:05,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698085977] [2020-10-14 02:30:05,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:30:05,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:30:05,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865708388] [2020-10-14 02:30:05,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:30:05,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:30:05,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:30:05,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:30:05,237 INFO L87 Difference]: Start difference. First operand 1641 states and 2180 transitions. Second operand 7 states. [2020-10-14 02:30:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:30:06,724 INFO L93 Difference]: Finished difference Result 3757 states and 5101 transitions. [2020-10-14 02:30:06,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-14 02:30:06,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2020-10-14 02:30:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:30:06,736 INFO L225 Difference]: With dead ends: 3757 [2020-10-14 02:30:06,736 INFO L226 Difference]: Without dead ends: 1681 [2020-10-14 02:30:06,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-14 02:30:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2020-10-14 02:30:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1643. [2020-10-14 02:30:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2020-10-14 02:30:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2112 transitions. [2020-10-14 02:30:06,807 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2112 transitions. Word has length 216 [2020-10-14 02:30:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:30:06,807 INFO L479 AbstractCegarLoop]: Abstraction has 1643 states and 2112 transitions. [2020-10-14 02:30:06,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:30:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2112 transitions. [2020-10-14 02:30:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-10-14 02:30:06,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:30:06,812 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:30:06,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-14 02:30:06,813 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:30:06,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:30:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1979848169, now seen corresponding path program 1 times [2020-10-14 02:30:06,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:30:06,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1282523207] [2020-10-14 02:30:06,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:30:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:06,940 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:07,504 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:07,505 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 236 [2020-10-14 02:30:07,505 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:07,505 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 580 [2020-10-14 02:30:07,505 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:07,505 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:07,506 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 02:30:07,506 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 02:30:07,506 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-14 02:30:07,506 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:07,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:30:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:07,563 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:07,569 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:07,569 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:30:07,569 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:07,570 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-14 02:30:07,570 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:07,570 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:07,570 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:30:07,570 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:07,571 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 02:30:07,571 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:07,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:30:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:07,610 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:07,747 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:07,747 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-14 02:30:07,747 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:07,747 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 147 [2020-10-14 02:30:07,748 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:07,748 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:07,748 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:07,748 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:30:07,748 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 88 [2020-10-14 02:30:07,749 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:07,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-14 02:30:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:07,840 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:07,904 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:07,905 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-14 02:30:07,908 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:07,908 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 79 [2020-10-14 02:30:07,909 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:07,909 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:07,909 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:30:07,909 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 117 [2020-10-14 02:30:07,909 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:30:07,910 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 22 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-14 02:30:08,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1282523207] [2020-10-14 02:30:08,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:30:08,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:30:08,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464081715] [2020-10-14 02:30:08,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:30:08,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:30:08,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:30:08,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:30:08,034 INFO L87 Difference]: Start difference. First operand 1643 states and 2112 transitions. Second operand 7 states. [2020-10-14 02:30:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:30:09,210 INFO L93 Difference]: Finished difference Result 3441 states and 4418 transitions. [2020-10-14 02:30:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-14 02:30:09,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2020-10-14 02:30:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:30:09,221 INFO L225 Difference]: With dead ends: 3441 [2020-10-14 02:30:09,222 INFO L226 Difference]: Without dead ends: 1804 [2020-10-14 02:30:09,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-14 02:30:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2020-10-14 02:30:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1788. [2020-10-14 02:30:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1788 states. [2020-10-14 02:30:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2273 transitions. [2020-10-14 02:30:09,282 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2273 transitions. Word has length 224 [2020-10-14 02:30:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:30:09,282 INFO L479 AbstractCegarLoop]: Abstraction has 1788 states and 2273 transitions. [2020-10-14 02:30:09,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:30:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2273 transitions. [2020-10-14 02:30:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-10-14 02:30:09,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:30:09,287 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:30:09,288 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-14 02:30:09,288 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:30:09,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:30:09,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1347084943, now seen corresponding path program 1 times [2020-10-14 02:30:09,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:30:09,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1043179410] [2020-10-14 02:30:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:30:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:09,458 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:09,861 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:09,861 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 264 [2020-10-14 02:30:09,861 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:09,861 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 459 [2020-10-14 02:30:09,862 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:09,862 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:09,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:09,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-14 02:30:09,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-14 02:30:09,862 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:09,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:30:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:09,925 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:09,927 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:09,928 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:30:09,928 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:09,928 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 02:30:09,928 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:09,928 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:09,929 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:30:09,929 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:09,930 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:30:09,930 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:09,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:30:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:09,979 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:10,070 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:10,070 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-14 02:30:10,071 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:10,071 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 106 [2020-10-14 02:30:10,071 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:10,071 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:10,072 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:30:10,072 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:10,072 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-14 02:30:10,072 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:10,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-14 02:30:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:10,189 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:10,369 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:10,370 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-14 02:30:10,370 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:10,370 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 201 [2020-10-14 02:30:10,371 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:10,371 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:10,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:10,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:30:10,371 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-14 02:30:10,372 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 134 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:30:10,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1043179410] [2020-10-14 02:30:10,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:30:10,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:30:10,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522868235] [2020-10-14 02:30:10,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:30:10,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:30:10,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:30:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:30:10,512 INFO L87 Difference]: Start difference. First operand 1788 states and 2273 transitions. Second operand 7 states. [2020-10-14 02:30:11,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:30:11,997 INFO L93 Difference]: Finished difference Result 3735 states and 4880 transitions. [2020-10-14 02:30:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 02:30:11,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 252 [2020-10-14 02:30:11,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:30:12,007 INFO L225 Difference]: With dead ends: 3735 [2020-10-14 02:30:12,007 INFO L226 Difference]: Without dead ends: 2096 [2020-10-14 02:30:12,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-14 02:30:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2020-10-14 02:30:12,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2084. [2020-10-14 02:30:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2020-10-14 02:30:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2605 transitions. [2020-10-14 02:30:12,069 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2605 transitions. Word has length 252 [2020-10-14 02:30:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:30:12,069 INFO L479 AbstractCegarLoop]: Abstraction has 2084 states and 2605 transitions. [2020-10-14 02:30:12,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:30:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2605 transitions. [2020-10-14 02:30:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2020-10-14 02:30:12,077 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:30:12,077 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:30:12,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-14 02:30:12,077 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:30:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:30:12,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1975586957, now seen corresponding path program 1 times [2020-10-14 02:30:12,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:30:12,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2078162830] [2020-10-14 02:30:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:30:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:12,186 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:12,658 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:12,658 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 353 [2020-10-14 02:30:12,658 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:12,658 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 509 [2020-10-14 02:30:12,659 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:12,659 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:12,659 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:12,659 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-14 02:30:12,659 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 90 [2020-10-14 02:30:12,660 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:12,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:30:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:12,727 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:12,729 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:12,729 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:30:12,729 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:12,729 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:30:12,729 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:12,730 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:12,730 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:30:12,730 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:12,730 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:30:12,730 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:12,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:30:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:12,778 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:12,843 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:12,843 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-14 02:30:12,843 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:12,843 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 77 [2020-10-14 02:30:12,844 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:12,844 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:12,844 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:30:12,844 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:30:12,844 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-14 02:30:12,844 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:30:12,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-14 02:30:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:12,912 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:13,055 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:13,055 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-14 02:30:13,056 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:13,056 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 152 [2020-10-14 02:30:13,056 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:13,057 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:13,057 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:30:13,057 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:30:13,058 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 88 [2020-10-14 02:30:13,058 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:30:13,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2020-10-14 02:30:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:30:13,261 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:30:13,335 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:30:13,336 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-14 02:30:13,336 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:30:13,336 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 95 [2020-10-14 02:30:13,337 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:30:13,337 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:30:13,338 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:30:13,338 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 117 [2020-10-14 02:30:13,339 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:30:13,339 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 02:30:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 121 proven. 86 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-10-14 02:30:13,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2078162830] [2020-10-14 02:30:13,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:30:13,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:30:13,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969313717] [2020-10-14 02:30:13,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:30:13,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:30:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:30:13,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:30:13,756 INFO L87 Difference]: Start difference. First operand 2084 states and 2605 transitions. Second operand 7 states. [2020-10-14 02:30:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:30:15,410 INFO L93 Difference]: Finished difference Result 4327 states and 5455 transitions. [2020-10-14 02:30:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 02:30:15,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 339 [2020-10-14 02:30:15,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:30:15,423 INFO L225 Difference]: With dead ends: 4327 [2020-10-14 02:30:15,423 INFO L226 Difference]: Without dead ends: 2392 [2020-10-14 02:30:15,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-14 02:30:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2020-10-14 02:30:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2388. [2020-10-14 02:30:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2020-10-14 02:30:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 2950 transitions. [2020-10-14 02:30:15,493 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 2950 transitions. Word has length 339 [2020-10-14 02:30:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:30:15,493 INFO L479 AbstractCegarLoop]: Abstraction has 2388 states and 2950 transitions. [2020-10-14 02:30:15,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:30:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 2950 transitions. [2020-10-14 02:30:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2020-10-14 02:30:15,501 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:30:15,502 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-14 02:30:15,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-14 02:30:15,502 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:30:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:30:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1305153370, now seen corresponding path program 1 times [2020-10-14 02:30:15,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:30:15,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1506809093] [2020-10-14 02:30:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:30:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-14 02:30:15,601 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-14 02:30:15,602 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-14 02:30:15,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-14 02:30:15,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:30:15 BoogieIcfgContainer [2020-10-14 02:30:15,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-14 02:30:15,693 INFO L168 Benchmark]: Toolchain (without parser) took 26815.95 ms. Allocated memory was 148.4 MB in the beginning and 594.0 MB in the end (delta: 445.6 MB). Free memory was 101.8 MB in the beginning and 108.8 MB in the end (delta: -7.0 MB). Peak memory consumption was 438.7 MB. Max. memory is 7.1 GB. [2020-10-14 02:30:15,699 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 148.4 MB. Free memory was 121.7 MB in the beginning and 121.2 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-14 02:30:15,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.41 ms. Allocated memory was 148.4 MB in the beginning and 206.6 MB in the end (delta: 58.2 MB). Free memory was 101.4 MB in the beginning and 173.4 MB in the end (delta: -71.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2020-10-14 02:30:15,701 INFO L168 Benchmark]: Boogie Preprocessor took 119.99 ms. Allocated memory is still 206.6 MB. Free memory was 173.4 MB in the beginning and 168.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-10-14 02:30:15,707 INFO L168 Benchmark]: RCFGBuilder took 1330.07 ms. Allocated memory was 206.6 MB in the beginning and 234.9 MB in the end (delta: 28.3 MB). Free memory was 168.5 MB in the beginning and 174.3 MB in the end (delta: -5.9 MB). Peak memory consumption was 78.9 MB. Max. memory is 7.1 GB. [2020-10-14 02:30:15,708 INFO L168 Benchmark]: TraceAbstraction took 24608.33 ms. Allocated memory was 234.9 MB in the beginning and 594.0 MB in the end (delta: 359.1 MB). Free memory was 174.3 MB in the beginning and 108.8 MB in the end (delta: 65.5 MB). Peak memory consumption was 424.7 MB. Max. memory is 7.1 GB. [2020-10-14 02:30:15,714 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.19 ms. Allocated memory is still 148.4 MB. Free memory was 121.7 MB in the beginning and 121.2 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.41 ms. Allocated memory was 148.4 MB in the beginning and 206.6 MB in the end (delta: 58.2 MB). Free memory was 101.4 MB in the beginning and 173.4 MB in the end (delta: -71.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.99 ms. Allocated memory is still 206.6 MB. Free memory was 173.4 MB in the beginning and 168.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1330.07 ms. Allocated memory was 206.6 MB in the beginning and 234.9 MB in the end (delta: 28.3 MB). Free memory was 168.5 MB in the beginning and 174.3 MB in the end (delta: -5.9 MB). Peak memory consumption was 78.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24608.33 ms. Allocated memory was 234.9 MB in the beginning and 594.0 MB in the end (delta: 359.1 MB). Free memory was 174.3 MB in the beginning and 108.8 MB in the end (delta: 65.5 MB). Peak memory consumption was 424.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 40]: 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 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 TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L527] a1 = (((a1 * 5) + 278443) - -239546) [L528] return 26; [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 TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)) [L297] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819) [L298] a10 = 4 [L300] return 26; [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 TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L449] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L450] a10 = 3 [L451] a19 = 6 [L453] 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 TRUE (((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)) [L40] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.4s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 241 SDtfs, 3223 SDslu, 309 SDs, 0 SdLazy, 7803 SolverSat, 1131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2388occurred 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.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 396 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 1923 NumberOfCodeBlocks, 1923 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1557 ConstructedInterpolants, 0 QuantifiedInterpolants, 1202430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 694/871 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...