/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=BIGGEST --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-12 13:04:29,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-12 13:04:29,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-12 13:04:29,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-12 13:04:29,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-12 13:04:29,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-12 13:04:29,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-12 13:04:29,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-12 13:04:29,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-12 13:04:29,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-12 13:04:29,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-12 13:04:29,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-12 13:04:29,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-12 13:04:29,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-12 13:04:29,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-12 13:04:29,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-12 13:04:29,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-12 13:04:29,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-12 13:04:29,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-12 13:04:29,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-12 13:04:29,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-12 13:04:29,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-12 13:04:29,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-12 13:04:29,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-12 13:04:29,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-12 13:04:29,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-12 13:04:29,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-12 13:04:29,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-12 13:04:29,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-12 13:04:29,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-12 13:04:29,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-12 13:04:29,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-12 13:04:29,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-12 13:04:29,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-12 13:04:29,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-12 13:04:29,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-12 13:04:29,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-12 13:04:29,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-12 13:04:29,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-12 13:04:29,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-12 13:04:29,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-12 13:04:29,218 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-12 13:04:29,240 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-12 13:04:29,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-12 13:04:29,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-12 13:04:29,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-12 13:04:29,242 INFO L138 SettingsManager]: * Use SBE=true [2020-10-12 13:04:29,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-12 13:04:29,242 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-12 13:04:29,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-12 13:04:29,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-12 13:04:29,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-12 13:04:29,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-12 13:04:29,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-12 13:04:29,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-12 13:04:29,243 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-12 13:04:29,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-12 13:04:29,244 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-12 13:04:29,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-12 13:04:29,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-12 13:04:29,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-12 13:04:29,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-12 13:04:29,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-12 13:04:29,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-12 13:04:29,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-12 13:04:29,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-12 13:04:29,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-12 13:04:29,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-12 13:04:29,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-12 13:04:29,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-12 13:04:29,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-12 13:04:29,246 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=BIGGEST;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=BIGGEST;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=BIGGEST;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=BIGGEST;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=BIGGEST;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=BIGGEST;log-additional-information=true;unknown-allowed=true; [2020-10-12 13:04:29,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-12 13:04:29,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-12 13:04:29,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-12 13:04:29,539 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-12 13:04:29,540 INFO L275 PluginConnector]: CDTParser initialized [2020-10-12 13:04:29,541 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-12 13:04:29,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/19d8bb18e/8b5056196dc04b69a9c0498191f81f96/FLAG338884883 [2020-10-12 13:04:30,145 INFO L306 CDTParser]: Found 1 translation units. [2020-10-12 13:04:30,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label12.c [2020-10-12 13:04:30,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/19d8bb18e/8b5056196dc04b69a9c0498191f81f96/FLAG338884883 [2020-10-12 13:04:30,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/19d8bb18e/8b5056196dc04b69a9c0498191f81f96 [2020-10-12 13:04:30,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-12 13:04:30,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-12 13:04:30,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-12 13:04:30,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-12 13:04:30,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-12 13:04:30,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:04:30" (1/1) ... [2020-10-12 13:04:30,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283e1fb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:30, skipping insertion in model container [2020-10-12 13:04:30,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:04:30" (1/1) ... [2020-10-12 13:04:30,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-12 13:04:30,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-12 13:04:31,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-12 13:04:31,034 INFO L203 MainTranslator]: Completed pre-run [2020-10-12 13:04:31,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-12 13:04:31,298 INFO L208 MainTranslator]: Completed translation [2020-10-12 13:04:31,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:31 WrapperNode [2020-10-12 13:04:31,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-12 13:04:31,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-12 13:04:31,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-12 13:04:31,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-12 13:04:31,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:31" (1/1) ... [2020-10-12 13:04:31,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:31" (1/1) ... [2020-10-12 13:04:31,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:31" (1/1) ... [2020-10-12 13:04:31,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:31" (1/1) ... [2020-10-12 13:04:31,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:31" (1/1) ... [2020-10-12 13:04:31,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:31" (1/1) ... [2020-10-12 13:04:31,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:31" (1/1) ... [2020-10-12 13:04:31,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-12 13:04:31,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-12 13:04:31,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-12 13:04:31,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-12 13:04:31,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:31" (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-12 13:04:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-12 13:04:31,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-12 13:04:31,489 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-12 13:04:31,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-12 13:04:31,490 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-12 13:04:31,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-12 13:04:31,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-12 13:04:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-12 13:04:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-12 13:04:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-12 13:04:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-12 13:04:32,873 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-12 13:04:32,874 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-12 13:04:32,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:04:32 BoogieIcfgContainer [2020-10-12 13:04:32,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-12 13:04:32,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-12 13:04:32,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-12 13:04:32,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-12 13:04:32,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 01:04:30" (1/3) ... [2020-10-12 13:04:32,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63518643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 01:04:32, skipping insertion in model container [2020-10-12 13:04:32,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:04:31" (2/3) ... [2020-10-12 13:04:32,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63518643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 01:04:32, skipping insertion in model container [2020-10-12 13:04:32,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:04:32" (3/3) ... [2020-10-12 13:04:32,891 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label12.c [2020-10-12 13:04:32,903 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-12 13:04:32,911 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-12 13:04:32,926 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-12 13:04:32,953 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-12 13:04:32,953 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-12 13:04:32,953 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-12 13:04:32,953 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-12 13:04:32,954 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-12 13:04:32,954 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-12 13:04:32,954 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-12 13:04:32,954 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-12 13:04:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-12 13:04:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-12 13:04:32,985 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:04:32,986 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-12 13:04:32,987 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:04:32,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:04:32,993 INFO L82 PathProgramCache]: Analyzing trace with hash 242271255, now seen corresponding path program 1 times [2020-10-12 13:04:33,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:04:33,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1205735703] [2020-10-12 13:04:33,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:04:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:33,192 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:33,494 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:33,496 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 26 [2020-10-12 13:04:33,496 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:33,496 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 350 [2020-10-12 13:04:33,502 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:33,502 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:04:33,503 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:04:33,503 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 20 [2020-10-12 13:04:33,503 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-12 13:04:33,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:04:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:33,629 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:33,653 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:33,654 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:04:33,654 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:33,654 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 29 [2020-10-12 13:04:33,655 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:33,657 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:04:33,658 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:33,658 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:04:33,658 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-12 13:04:33,702 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-12 13:04:33,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1205735703] [2020-10-12 13:04:33,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-12 13:04:33,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-12 13:04:33,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554042840] [2020-10-12 13:04:33,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-12 13:04:33,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:04:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-12 13:04:33,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-12 13:04:33,743 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-10-12 13:04:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:04:35,922 INFO L93 Difference]: Finished difference Result 730 states and 1300 transitions. [2020-10-12 13:04:35,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-12 13:04:35,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-12 13:04:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:04:35,951 INFO L225 Difference]: With dead ends: 730 [2020-10-12 13:04:35,951 INFO L226 Difference]: Without dead ends: 447 [2020-10-12 13:04:35,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:04:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-10-12 13:04:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2020-10-12 13:04:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-10-12 13:04:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 615 transitions. [2020-10-12 13:04:36,072 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 615 transitions. Word has length 18 [2020-10-12 13:04:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:04:36,072 INFO L479 AbstractCegarLoop]: Abstraction has 443 states and 615 transitions. [2020-10-12 13:04:36,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-12 13:04:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 615 transitions. [2020-10-12 13:04:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-12 13:04:36,077 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:04:36,078 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-12 13:04:36,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-12 13:04:36,078 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:04:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:04:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash -138419591, now seen corresponding path program 1 times [2020-10-12 13:04:36,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:04:36,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1954217191] [2020-10-12 13:04:36,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:04:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:36,157 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:36,218 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:36,435 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:37,836 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:37,837 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 105 [2020-10-12 13:04:37,837 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-12 13:04:37,837 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1707 [2020-10-12 13:04:37,838 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:37,838 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-12 13:04:37,839 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:04:37,839 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 99 [2020-10-12 13:04:37,840 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-12 13:04:37,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:04:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:37,903 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:37,907 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:37,907 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:04:37,907 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:37,908 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-12 13:04:37,908 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:37,908 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:04:37,908 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:37,909 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:04:37,909 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:04:37,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:04:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:37,948 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:37,999 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:38,122 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:38,123 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-12 13:04:38,123 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:04:38,124 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 186 [2020-10-12 13:04:38,124 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:38,124 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:38,124 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:04:38,125 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-12 13:04:38,125 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-12 13:04:38,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1954217191] [2020-10-12 13:04:38,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:04:38,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-12 13:04:38,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722117800] [2020-10-12 13:04:38,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-12 13:04:38,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:04:38,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-12 13:04:38,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-12 13:04:38,210 INFO L87 Difference]: Start difference. First operand 443 states and 615 transitions. Second operand 6 states. [2020-10-12 13:04:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:04:39,458 INFO L93 Difference]: Finished difference Result 1323 states and 1877 transitions. [2020-10-12 13:04:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-12 13:04:39,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2020-10-12 13:04:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:04:39,466 INFO L225 Difference]: With dead ends: 1323 [2020-10-12 13:04:39,466 INFO L226 Difference]: Without dead ends: 886 [2020-10-12 13:04:39,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:04:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2020-10-12 13:04:39,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 880. [2020-10-12 13:04:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2020-10-12 13:04:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1184 transitions. [2020-10-12 13:04:39,514 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1184 transitions. Word has length 95 [2020-10-12 13:04:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:04:39,514 INFO L479 AbstractCegarLoop]: Abstraction has 880 states and 1184 transitions. [2020-10-12 13:04:39,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-12 13:04:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1184 transitions. [2020-10-12 13:04:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-10-12 13:04:39,533 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:04:39,533 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-12 13:04:39,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-12 13:04:39,534 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:04:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:04:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash -427365918, now seen corresponding path program 1 times [2020-10-12 13:04:39,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:04:39,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [994362882] [2020-10-12 13:04:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:04:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:39,663 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:40,090 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:40,090 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 219 [2020-10-12 13:04:40,091 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:40,091 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 480 [2020-10-12 13:04:40,091 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:40,091 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:40,091 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-12 13:04:40,092 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-12 13:04:40,092 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:40,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:04:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:40,189 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:40,192 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:40,192 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:04:40,192 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:40,192 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-12 13:04:40,193 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:40,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:04:40,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:40,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:04:40,194 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:40,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:04:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:40,225 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:40,276 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:40,279 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-12 13:04:40,280 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:40,280 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 59 [2020-10-12 13:04:40,280 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:40,281 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:04:40,281 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:40,281 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-12 13:04:40,281 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:04:40,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-12 13:04:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:40,378 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:40,560 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:40,561 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-12 13:04:40,561 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:40,561 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 205 [2020-10-12 13:04:40,561 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:40,561 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:40,562 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:04:40,562 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-12 13:04:40,562 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:40,716 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-12 13:04:40,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [994362882] [2020-10-12 13:04:40,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:04:40,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:04:40,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077656176] [2020-10-12 13:04:40,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:04:40,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:04:40,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:04:40,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:04:40,720 INFO L87 Difference]: Start difference. First operand 880 states and 1184 transitions. Second operand 7 states. [2020-10-12 13:04:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:04:42,312 INFO L93 Difference]: Finished difference Result 2084 states and 2890 transitions. [2020-10-12 13:04:42,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-12 13:04:42,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 207 [2020-10-12 13:04:42,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:04:42,326 INFO L225 Difference]: With dead ends: 2084 [2020-10-12 13:04:42,327 INFO L226 Difference]: Without dead ends: 1210 [2020-10-12 13:04:42,330 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-12 13:04:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-10-12 13:04:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1045. [2020-10-12 13:04:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2020-10-12 13:04:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1390 transitions. [2020-10-12 13:04:42,384 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1390 transitions. Word has length 207 [2020-10-12 13:04:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:04:42,386 INFO L479 AbstractCegarLoop]: Abstraction has 1045 states and 1390 transitions. [2020-10-12 13:04:42,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:04:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1390 transitions. [2020-10-12 13:04:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-10-12 13:04:42,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:04:42,400 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-12 13:04:42,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-12 13:04:42,401 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:04:42,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:04:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1883183011, now seen corresponding path program 1 times [2020-10-12 13:04:42,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:04:42,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1084919613] [2020-10-12 13:04:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:04:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:42,458 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:42,718 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:43,669 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:43,669 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 226 [2020-10-12 13:04:43,669 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:04:43,669 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1228 [2020-10-12 13:04:43,677 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:43,677 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-12 13:04:43,677 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-12 13:04:43,678 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 83 [2020-10-12 13:04:43,678 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:43,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:04:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:43,732 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:43,736 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:43,736 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:04:43,736 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:43,736 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-12 13:04:43,737 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:43,737 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:04:43,737 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:43,737 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-12 13:04:43,738 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:43,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:04:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:43,775 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:43,860 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:43,861 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-12 13:04:43,861 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:43,861 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 95 [2020-10-12 13:04:43,861 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:43,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:43,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:04:43,862 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-12 13:04:43,862 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:43,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-12 13:04:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:43,982 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:44,030 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:44,030 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-12 13:04:44,030 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:44,030 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 69 [2020-10-12 13:04:44,031 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:44,031 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:04:44,031 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 117 [2020-10-12 13:04:44,031 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:04:44,031 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-12 13:04:44,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1084919613] [2020-10-12 13:04:44,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:04:44,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:04:44,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308548725] [2020-10-12 13:04:44,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:04:44,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:04:44,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:04:44,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:04:44,159 INFO L87 Difference]: Start difference. First operand 1045 states and 1390 transitions. Second operand 7 states. [2020-10-12 13:04:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:04:45,436 INFO L93 Difference]: Finished difference Result 2255 states and 2997 transitions. [2020-10-12 13:04:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-12 13:04:45,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 214 [2020-10-12 13:04:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:04:45,452 INFO L225 Difference]: With dead ends: 2255 [2020-10-12 13:04:45,452 INFO L226 Difference]: Without dead ends: 1216 [2020-10-12 13:04:45,456 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-12 13:04:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2020-10-12 13:04:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1196. [2020-10-12 13:04:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1196 states. [2020-10-12 13:04:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1559 transitions. [2020-10-12 13:04:45,504 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1559 transitions. Word has length 214 [2020-10-12 13:04:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:04:45,505 INFO L479 AbstractCegarLoop]: Abstraction has 1196 states and 1559 transitions. [2020-10-12 13:04:45,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:04:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1559 transitions. [2020-10-12 13:04:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-10-12 13:04:45,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:04:45,509 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-12 13:04:45,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-12 13:04:45,510 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:04:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:04:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1683218055, now seen corresponding path program 1 times [2020-10-12 13:04:45,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:04:45,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721371075] [2020-10-12 13:04:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:04:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:45,570 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:45,758 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:46,045 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:46,046 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 228 [2020-10-12 13:04:46,046 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:04:46,046 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 497 [2020-10-12 13:04:46,046 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:46,047 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:46,047 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-12 13:04:46,047 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-12 13:04:46,047 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:46,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:04:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:46,100 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:46,103 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:46,103 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:04:46,103 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:46,103 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-12 13:04:46,104 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:46,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:04:46,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:46,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:04:46,104 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:46,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:04:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:46,137 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:46,182 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:46,182 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-12 13:04:46,182 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:46,182 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 53 [2020-10-12 13:04:46,183 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:46,183 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:04:46,183 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:46,183 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-12 13:04:46,184 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:46,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-12 13:04:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:46,241 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:46,381 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:46,381 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-12 13:04:46,381 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:46,382 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 155 [2020-10-12 13:04:46,382 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:46,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:46,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:04:46,383 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-12 13:04:46,383 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:46,485 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-12 13:04:46,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721371075] [2020-10-12 13:04:46,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:04:46,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:04:46,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895876696] [2020-10-12 13:04:46,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:04:46,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:04:46,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:04:46,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:04:46,488 INFO L87 Difference]: Start difference. First operand 1196 states and 1559 transitions. Second operand 7 states. [2020-10-12 13:04:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:04:48,511 INFO L93 Difference]: Finished difference Result 2984 states and 3936 transitions. [2020-10-12 13:04:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-12 13:04:48,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2020-10-12 13:04:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:04:48,523 INFO L225 Difference]: With dead ends: 2984 [2020-10-12 13:04:48,523 INFO L226 Difference]: Without dead ends: 1492 [2020-10-12 13:04:48,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-12 13:04:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2020-10-12 13:04:48,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1198. [2020-10-12 13:04:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2020-10-12 13:04:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1513 transitions. [2020-10-12 13:04:48,569 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1513 transitions. Word has length 216 [2020-10-12 13:04:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:04:48,569 INFO L479 AbstractCegarLoop]: Abstraction has 1198 states and 1513 transitions. [2020-10-12 13:04:48,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:04:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1513 transitions. [2020-10-12 13:04:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-10-12 13:04:48,573 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:04:48,574 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-12 13:04:48,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-12 13:04:48,574 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:04:48,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:04:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1347084943, now seen corresponding path program 1 times [2020-10-12 13:04:48,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:04:48,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [758673212] [2020-10-12 13:04:48,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:04:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:48,721 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:49,062 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:49,063 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 264 [2020-10-12 13:04:49,063 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:49,063 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 392 [2020-10-12 13:04:49,063 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:49,064 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:49,064 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-12 13:04:49,064 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-12 13:04:49,064 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:49,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:04:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:49,130 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:49,132 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:49,132 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:04:49,132 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:49,132 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-12 13:04:49,133 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:49,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:04:49,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:49,133 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:04:49,133 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:49,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:04:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:49,183 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:49,258 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:49,258 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-12 13:04:49,259 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:49,259 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 91 [2020-10-12 13:04:49,259 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:49,259 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:04:49,260 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:49,260 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-12 13:04:49,260 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:49,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-12 13:04:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:49,377 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:49,520 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:49,520 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-12 13:04:49,520 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:49,520 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 157 [2020-10-12 13:04:49,521 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:49,521 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:49,521 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:04:49,521 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-12 13:04:49,521 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:49,750 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-12 13:04:49,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [758673212] [2020-10-12 13:04:49,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:04:49,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:04:49,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761002561] [2020-10-12 13:04:49,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:04:49,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:04:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:04:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:04:49,753 INFO L87 Difference]: Start difference. First operand 1198 states and 1513 transitions. Second operand 7 states. [2020-10-12 13:04:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:04:51,078 INFO L93 Difference]: Finished difference Result 2557 states and 3349 transitions. [2020-10-12 13:04:51,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-12 13:04:51,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 252 [2020-10-12 13:04:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:04:51,092 INFO L225 Difference]: With dead ends: 2557 [2020-10-12 13:04:51,092 INFO L226 Difference]: Without dead ends: 1508 [2020-10-12 13:04:51,095 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-12 13:04:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2020-10-12 13:04:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1496. [2020-10-12 13:04:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2020-10-12 13:04:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1886 transitions. [2020-10-12 13:04:51,138 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1886 transitions. Word has length 252 [2020-10-12 13:04:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:04:51,139 INFO L479 AbstractCegarLoop]: Abstraction has 1496 states and 1886 transitions. [2020-10-12 13:04:51,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:04:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1886 transitions. [2020-10-12 13:04:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2020-10-12 13:04:51,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:04:51,147 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12 13:04:51,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-12 13:04:51,148 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:04:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:04:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash 483637657, now seen corresponding path program 1 times [2020-10-12 13:04:51,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:04:51,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [956987667] [2020-10-12 13:04:51,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:04:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:51,327 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:51,727 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:52,386 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:52,387 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 343 [2020-10-12 13:04:52,387 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-12 13:04:52,388 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1116 [2020-10-12 13:04:52,388 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:52,388 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:52,388 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-12 13:04:52,389 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-12 13:04:52,389 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:52,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:04:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:52,459 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:52,461 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:52,461 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:04:52,462 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:52,462 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-12 13:04:52,462 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:52,462 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:04:52,462 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:52,463 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:04:52,463 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:52,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:04:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:52,511 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:52,587 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:52,588 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-12 13:04:52,588 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:52,588 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 89 [2020-10-12 13:04:52,588 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:52,589 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:04:52,589 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:52,589 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-12 13:04:52,589 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:52,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-12 13:04:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:52,651 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:52,745 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:52,746 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-12 13:04:52,746 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:52,746 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 103 [2020-10-12 13:04:52,746 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:52,747 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:52,747 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:04:52,747 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-12 13:04:52,748 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:52,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2020-10-12 13:04:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:52,878 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:52,929 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:52,930 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-12 13:04:52,930 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:52,930 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 64 [2020-10-12 13:04:52,931 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:52,931 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:04:52,931 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 117 [2020-10-12 13:04:52,932 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:04:52,932 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:04:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 111 proven. 76 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-10-12 13:04:53,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [956987667] [2020-10-12 13:04:53,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:04:53,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:04:53,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68402900] [2020-10-12 13:04:53,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:04:53,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:04:53,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:04:53,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:04:53,177 INFO L87 Difference]: Start difference. First operand 1496 states and 1886 transitions. Second operand 7 states. [2020-10-12 13:04:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:04:54,696 INFO L93 Difference]: Finished difference Result 3161 states and 4060 transitions. [2020-10-12 13:04:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-12 13:04:54,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 329 [2020-10-12 13:04:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:04:54,708 INFO L225 Difference]: With dead ends: 3161 [2020-10-12 13:04:54,708 INFO L226 Difference]: Without dead ends: 1814 [2020-10-12 13:04:54,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-12 13:04:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2020-10-12 13:04:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1796. [2020-10-12 13:04:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2020-10-12 13:04:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2223 transitions. [2020-10-12 13:04:54,787 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2223 transitions. Word has length 329 [2020-10-12 13:04:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:04:54,787 INFO L479 AbstractCegarLoop]: Abstraction has 1796 states and 2223 transitions. [2020-10-12 13:04:54,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:04:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2223 transitions. [2020-10-12 13:04:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2020-10-12 13:04:54,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:04:54,797 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12 13:04:54,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-12 13:04:54,798 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:04:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:04:54,798 INFO L82 PathProgramCache]: Analyzing trace with hash 291136678, now seen corresponding path program 1 times [2020-10-12 13:04:54,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:04:54,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [25159641] [2020-10-12 13:04:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:04:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:54,937 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:55,443 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:55,443 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 362 [2020-10-12 13:04:55,443 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:55,444 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 556 [2020-10-12 13:04:55,444 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:55,444 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:55,444 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 223 [2020-10-12 13:04:55,444 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-12 13:04:55,444 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:55,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-12 13:04:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:55,534 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:55,536 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:55,536 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-12 13:04:55,536 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:55,536 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-12 13:04:55,536 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:55,537 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:04:55,537 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:55,537 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:04:55,537 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:55,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-12 13:04:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:55,556 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:55,592 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:55,593 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 135 [2020-10-12 13:04:55,593 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:55,593 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 37 [2020-10-12 13:04:55,593 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:55,594 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-12 13:04:55,594 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:55,594 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-12 13:04:55,594 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:55,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-10-12 13:04:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:55,656 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:55,706 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:55,706 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-12 13:04:55,706 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:55,707 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 58 [2020-10-12 13:04:55,707 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:55,707 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-12 13:04:55,707 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-12 13:04:55,707 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-12 13:04:55,708 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-12 13:04:55,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-10-12 13:04:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-12 13:04:55,762 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-12 13:04:55,944 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-12 13:04:55,945 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-12 13:04:55,945 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-12 13:04:55,946 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 196 [2020-10-12 13:04:55,946 FATAL L256 erpolLogProxyWrapper]: Heuristic: BIGGEST [2020-10-12 13:04:55,946 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-12 13:04:55,947 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-12 13:04:55,947 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-12 13:04:55,947 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-12 13:04:56,402 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 228 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-10-12 13:04:56,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [25159641] [2020-10-12 13:04:56,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-12 13:04:56,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-12 13:04:56,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753419796] [2020-10-12 13:04:56,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-12 13:04:56,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-12 13:04:56,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-12 13:04:56,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-12 13:04:56,445 INFO L87 Difference]: Start difference. First operand 1796 states and 2223 transitions. Second operand 7 states. [2020-10-12 13:04:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-12 13:04:58,139 INFO L93 Difference]: Finished difference Result 3608 states and 4546 transitions. [2020-10-12 13:04:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-12 13:04:58,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 348 [2020-10-12 13:04:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-12 13:04:58,152 INFO L225 Difference]: With dead ends: 3608 [2020-10-12 13:04:58,152 INFO L226 Difference]: Without dead ends: 1961 [2020-10-12 13:04:58,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-12 13:04:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2020-10-12 13:04:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1947. [2020-10-12 13:04:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2020-10-12 13:04:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2395 transitions. [2020-10-12 13:04:58,231 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2395 transitions. Word has length 348 [2020-10-12 13:04:58,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-12 13:04:58,232 INFO L479 AbstractCegarLoop]: Abstraction has 1947 states and 2395 transitions. [2020-10-12 13:04:58,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-12 13:04:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2395 transitions. [2020-10-12 13:04:58,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2020-10-12 13:04:58,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-12 13:04:58,242 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-12 13:04:58,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-12 13:04:58,242 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-12 13:04:58,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-12 13:04:58,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1305153370, now seen corresponding path program 1 times [2020-10-12 13:04:58,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-12 13:04:58,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [630426553] [2020-10-12 13:04:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-12 13:04:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-12 13:04:58,361 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-12 13:04:58,362 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-12 13:04:58,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-12 13:04:58,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 01:04:58 BoogieIcfgContainer [2020-10-12 13:04:58,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-12 13:04:58,457 INFO L168 Benchmark]: Toolchain (without parser) took 28012.78 ms. Allocated memory was 138.9 MB in the beginning and 710.4 MB in the end (delta: 571.5 MB). Free memory was 100.5 MB in the beginning and 397.6 MB in the end (delta: -297.1 MB). Peak memory consumption was 274.4 MB. Max. memory is 7.1 GB. [2020-10-12 13:04:58,457 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-12 13:04:58,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.03 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 169.5 MB in the end (delta: -69.2 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. [2020-10-12 13:04:58,459 INFO L168 Benchmark]: Boogie Preprocessor took 109.15 ms. Allocated memory is still 202.9 MB. Free memory was 169.5 MB in the beginning and 164.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-10-12 13:04:58,460 INFO L168 Benchmark]: RCFGBuilder took 1472.42 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 164.6 MB in the beginning and 180.7 MB in the end (delta: -16.0 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. [2020-10-12 13:04:58,461 INFO L168 Benchmark]: TraceAbstraction took 25570.51 ms. Allocated memory was 235.4 MB in the beginning and 710.4 MB in the end (delta: 475.0 MB). Free memory was 180.7 MB in the beginning and 397.6 MB in the end (delta: -216.9 MB). Peak memory consumption was 258.1 MB. Max. memory is 7.1 GB. [2020-10-12 13:04:58,465 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 855.03 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 169.5 MB in the end (delta: -69.2 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.15 ms. Allocated memory is still 202.9 MB. Free memory was 169.5 MB in the beginning and 164.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1472.42 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 164.6 MB in the beginning and 180.7 MB in the end (delta: -16.0 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25570.51 ms. Allocated memory was 235.4 MB in the beginning and 710.4 MB in the end (delta: 475.0 MB). Free memory was 180.7 MB in the beginning and 397.6 MB in the end (delta: -216.9 MB). Peak memory consumption was 258.1 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: 25.4s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 236 SDtfs, 3385 SDslu, 287 SDs, 0 SdLazy, 8034 SolverSat, 1277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1947occurred 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.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 533 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 2037 NumberOfCodeBlocks, 2037 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1671 ConstructedInterpolants, 0 QuantifiedInterpolants, 1286899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 891/1048 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...