/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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=SHALLOWEST --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 language data_model -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label36.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-26 22:41:43,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 22:41:43,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 22:41:43,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 22:41:43,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 22:41:43,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 22:41:43,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 22:41:43,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 22:41:43,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 22:41:43,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 22:41:43,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 22:41:43,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 22:41:43,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 22:41:43,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 22:41:43,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 22:41:43,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 22:41:43,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 22:41:43,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 22:41:43,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 22:41:43,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 22:41:43,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 22:41:43,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 22:41:43,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 22:41:43,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 22:41:43,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 22:41:43,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 22:41:43,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 22:41:43,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 22:41:43,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 22:41:43,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 22:41:43,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 22:41:43,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 22:41:43,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 22:41:43,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 22:41:43,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 22:41:43,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 22:41:43,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 22:41:43,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 22:41:43,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 22:41:43,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 22:41:43,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 22:41:43,357 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-26 22:41:43,390 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 22:41:43,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 22:41:43,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 22:41:43,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 22:41:43,393 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 22:41:43,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 22:41:43,393 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 22:41:43,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 22:41:43,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 22:41:43,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 22:41:43,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 22:41:43,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 22:41:43,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 22:41:43,395 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 22:41:43,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 22:41:43,395 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 22:41:43,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 22:41:43,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 22:41:43,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 22:41:43,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 22:41:43,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 22:41:43,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 22:41:43,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 22:41:43,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 22:41:43,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 22:41:43,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 22:41:43,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 22:41:43,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 22:41:43,398 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 22:41:43,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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=SHALLOWEST;log-additional-information=true;unknown-allowed=true; [2020-10-26 22:41:43,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 22:41:43,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 22:41:43,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 22:41:43,897 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 22:41:43,898 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 22:41:43,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label36.c [2020-10-26 22:41:43,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2731cb049/875622ffadc4419a88be093635420d2a/FLAG4467f1e36 [2020-10-26 22:41:44,810 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 22:41:44,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem11_label36.c [2020-10-26 22:41:44,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2731cb049/875622ffadc4419a88be093635420d2a/FLAG4467f1e36 [2020-10-26 22:41:44,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2731cb049/875622ffadc4419a88be093635420d2a [2020-10-26 22:41:44,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 22:41:45,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-26 22:41:45,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 22:41:45,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 22:41:45,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 22:41:45,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:41:44" (1/1) ... [2020-10-26 22:41:45,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b3ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45, skipping insertion in model container [2020-10-26 22:41:45,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:41:44" (1/1) ... [2020-10-26 22:41:45,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 22:41:45,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 22:41:45,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:41:45,785 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 22:41:45,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 22:41:45,964 INFO L208 MainTranslator]: Completed translation [2020-10-26 22:41:45,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45 WrapperNode [2020-10-26 22:41:45,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 22:41:45,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 22:41:45,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 22:41:45,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 22:41:45,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45" (1/1) ... [2020-10-26 22:41:45,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45" (1/1) ... [2020-10-26 22:41:46,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45" (1/1) ... [2020-10-26 22:41:46,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45" (1/1) ... [2020-10-26 22:41:46,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45" (1/1) ... [2020-10-26 22:41:46,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45" (1/1) ... [2020-10-26 22:41:46,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45" (1/1) ... [2020-10-26 22:41:46,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 22:41:46,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 22:41:46,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 22:41:46,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 22:41:46,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45" (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-26 22:41:46,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 22:41:46,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 22:41:46,257 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-26 22:41:46,258 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-26 22:41:46,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 22:41:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-26 22:41:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-26 22:41:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-26 22:41:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-26 22:41:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 22:41:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-26 22:41:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-26 22:41:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 22:41:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 22:41:46,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 22:41:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 22:41:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 22:41:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 22:41:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 22:41:48,398 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 22:41:48,398 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 22:41:48,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:41:48 BoogieIcfgContainer [2020-10-26 22:41:48,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 22:41:48,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 22:41:48,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 22:41:48,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 22:41:48,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:41:44" (1/3) ... [2020-10-26 22:41:48,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a9ba9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:41:48, skipping insertion in model container [2020-10-26 22:41:48,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:41:45" (2/3) ... [2020-10-26 22:41:48,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a9ba9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:41:48, skipping insertion in model container [2020-10-26 22:41:48,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:41:48" (3/3) ... [2020-10-26 22:41:48,411 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label36.c [2020-10-26 22:41:48,424 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-26 22:41:48,429 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-26 22:41:48,444 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-26 22:41:48,478 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 22:41:48,479 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 22:41:48,479 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-26 22:41:48,479 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 22:41:48,479 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 22:41:48,479 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 22:41:48,480 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 22:41:48,480 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 22:41:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states. [2020-10-26 22:41:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 22:41:48,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:41:48,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:41:48,515 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:41:48,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:41:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1554546992, now seen corresponding path program 1 times [2020-10-26 22:41:48,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:41:48,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [210051560] [2020-10-26 22:41:48,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:41:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:41:48,742 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:41:49,304 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:41:49,305 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 30 [2020-10-26 22:41:49,305 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:41:49,305 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 603 [2020-10-26 22:41:49,307 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:41:49,308 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:41:49,309 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:41:49,309 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 21 [2020-10-26 22:41:49,309 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-26 22:41:49,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:41:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:41:49,518 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:41:49,557 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:41:49,557 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:41:49,557 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:41:49,558 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 48 [2020-10-26 22:41:49,558 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:41:49,559 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:41:49,559 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:41:49,559 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:41:49,560 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:41:49,579 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-26 22:41:49,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [210051560] [2020-10-26 22:41:49,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:41:49,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 22:41:49,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418948211] [2020-10-26 22:41:49,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 22:41:49,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:41:49,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 22:41:49,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 22:41:49,615 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 4 states. [2020-10-26 22:41:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:41:52,879 INFO L93 Difference]: Finished difference Result 804 states and 1407 transitions. [2020-10-26 22:41:52,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 22:41:52,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-26 22:41:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:41:52,911 INFO L225 Difference]: With dead ends: 804 [2020-10-26 22:41:52,911 INFO L226 Difference]: Without dead ends: 444 [2020-10-26 22:41:52,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 22:41:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2020-10-26 22:41:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 430. [2020-10-26 22:41:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-10-26 22:41:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 646 transitions. [2020-10-26 22:41:53,024 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 646 transitions. Word has length 20 [2020-10-26 22:41:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:41:53,025 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 646 transitions. [2020-10-26 22:41:53,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 22:41:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 646 transitions. [2020-10-26 22:41:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-26 22:41:53,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:41:53,031 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:41:53,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 22:41:53,032 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:41:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:41:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash 430872528, now seen corresponding path program 1 times [2020-10-26 22:41:53,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:41:53,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573929437] [2020-10-26 22:41:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:41:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:41:53,145 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:41:53,671 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:41:54,490 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:41:54,491 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 102 [2020-10-26 22:41:54,491 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:41:54,491 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1381 [2020-10-26 22:41:54,492 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:41:54,493 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:41:54,493 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:41:54,493 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-26 22:41:54,493 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:41:54,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:41:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:41:54,612 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:41:54,627 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:41:54,628 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:41:54,629 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:41:54,631 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 18 [2020-10-26 22:41:54,634 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:41:54,634 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:41:54,635 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:41:54,635 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:41:54,635 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:41:54,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:41:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:41:54,705 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:41:54,907 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:41:54,907 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-26 22:41:54,907 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:41:54,908 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 221 [2020-10-26 22:41:54,908 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:41:54,908 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:41:54,908 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:41:54,908 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 71 [2020-10-26 22:41:54,909 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:41:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:41:55,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573929437] [2020-10-26 22:41:55,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:41:55,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 22:41:55,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893320939] [2020-10-26 22:41:55,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:41:55,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:41:55,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:41:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:41:55,015 INFO L87 Difference]: Start difference. First operand 430 states and 646 transitions. Second operand 7 states. [2020-10-26 22:41:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:41:58,360 INFO L93 Difference]: Finished difference Result 1264 states and 1941 transitions. [2020-10-26 22:41:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:41:58,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2020-10-26 22:41:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:41:58,370 INFO L225 Difference]: With dead ends: 1264 [2020-10-26 22:41:58,370 INFO L226 Difference]: Without dead ends: 840 [2020-10-26 22:41:58,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:41:58,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-10-26 22:41:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 820. [2020-10-26 22:41:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-10-26 22:41:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1124 transitions. [2020-10-26 22:41:58,468 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1124 transitions. Word has length 90 [2020-10-26 22:41:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:41:58,469 INFO L481 AbstractCegarLoop]: Abstraction has 820 states and 1124 transitions. [2020-10-26 22:41:58,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:41:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1124 transitions. [2020-10-26 22:41:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-26 22:41:58,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:41:58,476 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:41:58,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 22:41:58,476 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:41:58,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:41:58,477 INFO L82 PathProgramCache]: Analyzing trace with hash 920838344, now seen corresponding path program 1 times [2020-10-26 22:41:58,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:41:58,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1182580140] [2020-10-26 22:41:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:41:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:41:58,560 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:41:58,615 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:41:59,353 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:00,111 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:00,111 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 106 [2020-10-26 22:42:00,111 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:42:00,112 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1574 [2020-10-26 22:42:00,112 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:00,112 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-26 22:42:00,112 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:42:00,112 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-10-26 22:42:00,112 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:42:00,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:42:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:00,228 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:00,238 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:00,238 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:42:00,239 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:42:00,239 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-10-26 22:42:00,239 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:00,239 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:42:00,239 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:42:00,239 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:42:00,240 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:42:00,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:42:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:00,302 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:00,443 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:00,444 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-10-26 22:42:00,444 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:42:00,444 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 158 [2020-10-26 22:42:00,444 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:00,444 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:42:00,445 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:42:00,445 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-10-26 22:42:00,445 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:42:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:42:00,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1182580140] [2020-10-26 22:42:00,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 22:42:00,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 22:42:00,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754757035] [2020-10-26 22:42:00,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:42:00,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:42:00,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:42:00,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:42:00,703 INFO L87 Difference]: Start difference. First operand 820 states and 1124 transitions. Second operand 7 states. [2020-10-26 22:42:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:42:03,968 INFO L93 Difference]: Finished difference Result 2033 states and 2754 transitions. [2020-10-26 22:42:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:42:03,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2020-10-26 22:42:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:42:03,986 INFO L225 Difference]: With dead ends: 2033 [2020-10-26 22:42:03,986 INFO L226 Difference]: Without dead ends: 1219 [2020-10-26 22:42:03,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-26 22:42:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2020-10-26 22:42:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1204. [2020-10-26 22:42:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2020-10-26 22:42:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1542 transitions. [2020-10-26 22:42:04,049 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1542 transitions. Word has length 94 [2020-10-26 22:42:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:42:04,050 INFO L481 AbstractCegarLoop]: Abstraction has 1204 states and 1542 transitions. [2020-10-26 22:42:04,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:42:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1542 transitions. [2020-10-26 22:42:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-26 22:42:04,053 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:42:04,053 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:42:04,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 22:42:04,054 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:42:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:42:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1702643226, now seen corresponding path program 1 times [2020-10-26 22:42:04,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:42:04,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [8456229] [2020-10-26 22:42:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:42:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:04,149 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:04,276 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:05,062 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:05,063 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 148 [2020-10-26 22:42:05,063 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-26 22:42:05,063 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 943 [2020-10-26 22:42:05,063 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:05,063 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-26 22:42:05,064 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-26 22:42:05,064 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-26 22:42:05,072 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 8 [2020-10-26 22:42:05,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:42:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:05,239 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:05,256 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:05,257 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:42:05,257 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:42:05,257 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 19 [2020-10-26 22:42:05,258 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:05,258 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:42:05,258 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:42:05,258 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-26 22:42:05,259 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:42:05,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:42:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:05,352 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:05,603 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:05,604 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 117 [2020-10-26 22:42:05,604 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:42:05,604 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 280 [2020-10-26 22:42:05,604 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:05,604 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:42:05,604 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:42:05,605 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 117 [2020-10-26 22:42:05,605 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:42:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 22:42:05,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [8456229] [2020-10-26 22:42:05,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:42:05,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:42:05,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493313179] [2020-10-26 22:42:05,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:42:05,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:42:05,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:42:05,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:42:05,773 INFO L87 Difference]: Start difference. First operand 1204 states and 1542 transitions. Second operand 7 states. [2020-10-26 22:42:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:42:09,366 INFO L93 Difference]: Finished difference Result 2826 states and 3690 transitions. [2020-10-26 22:42:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 22:42:09,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2020-10-26 22:42:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:42:09,386 INFO L225 Difference]: With dead ends: 2826 [2020-10-26 22:42:09,386 INFO L226 Difference]: Without dead ends: 2006 [2020-10-26 22:42:09,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-26 22:42:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2020-10-26 22:42:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1987. [2020-10-26 22:42:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2020-10-26 22:42:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2519 transitions. [2020-10-26 22:42:09,478 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2519 transitions. Word has length 136 [2020-10-26 22:42:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:42:09,480 INFO L481 AbstractCegarLoop]: Abstraction has 1987 states and 2519 transitions. [2020-10-26 22:42:09,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:42:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2519 transitions. [2020-10-26 22:42:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-10-26 22:42:09,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:42:09,488 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:42:09,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 22:42:09,488 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:42:09,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:42:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash -873219133, now seen corresponding path program 1 times [2020-10-26 22:42:09,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:42:09,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [29402011] [2020-10-26 22:42:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:42:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:09,570 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:09,889 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:09,889 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 163 [2020-10-26 22:42:09,889 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:42:09,889 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 348 [2020-10-26 22:42:09,890 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:09,890 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:42:09,890 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 140 [2020-10-26 22:42:09,890 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 19 [2020-10-26 22:42:09,890 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:42:10,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:42:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:10,018 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:10,029 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:10,029 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:42:10,029 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:42:10,030 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-10-26 22:42:10,030 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:10,030 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:42:10,030 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:42:10,031 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:42:10,031 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-26 22:42:10,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:42:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:10,129 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:10,305 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:10,306 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 132 [2020-10-26 22:42:10,306 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:42:10,306 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 206 [2020-10-26 22:42:10,306 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:10,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:42:10,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:42:10,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 125 [2020-10-26 22:42:10,307 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:42:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 22:42:10,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [29402011] [2020-10-26 22:42:10,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:42:10,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-26 22:42:10,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650884487] [2020-10-26 22:42:10,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 22:42:10,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:42:10,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 22:42:10,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-26 22:42:10,444 INFO L87 Difference]: Start difference. First operand 1987 states and 2519 transitions. Second operand 6 states. [2020-10-26 22:42:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:42:14,379 INFO L93 Difference]: Finished difference Result 4373 states and 5788 transitions. [2020-10-26 22:42:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 22:42:14,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2020-10-26 22:42:14,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:42:14,413 INFO L225 Difference]: With dead ends: 4373 [2020-10-26 22:42:14,414 INFO L226 Difference]: Without dead ends: 2770 [2020-10-26 22:42:14,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-26 22:42:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2020-10-26 22:42:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2754. [2020-10-26 22:42:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2754 states. [2020-10-26 22:42:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 3552 transitions. [2020-10-26 22:42:14,500 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 3552 transitions. Word has length 151 [2020-10-26 22:42:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:42:14,501 INFO L481 AbstractCegarLoop]: Abstraction has 2754 states and 3552 transitions. [2020-10-26 22:42:14,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 22:42:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 3552 transitions. [2020-10-26 22:42:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-10-26 22:42:14,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:42:14,505 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 22:42:14,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 22:42:14,505 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:42:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:42:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1641382402, now seen corresponding path program 1 times [2020-10-26 22:42:14,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:42:14,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908830895] [2020-10-26 22:42:14,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:42:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:14,613 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:14,697 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:16,036 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:16,895 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:16,895 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 224 [2020-10-26 22:42:16,896 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-26 22:42:16,896 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2321 [2020-10-26 22:42:16,896 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:16,896 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:42:16,896 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 126 [2020-10-26 22:42:16,896 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-10-26 22:42:16,897 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:42:17,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 22:42:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:17,035 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:17,040 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:17,040 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-26 22:42:17,040 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:42:17,040 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-26 22:42:17,041 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:17,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-26 22:42:17,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:42:17,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-26 22:42:17,041 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:42:17,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-26 22:42:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:17,112 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:17,231 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:17,232 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 117 [2020-10-26 22:42:17,232 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:42:17,232 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 141 [2020-10-26 22:42:17,232 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:17,232 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-26 22:42:17,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-26 22:42:17,233 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 111 [2020-10-26 22:42:17,233 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:42:17,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-10-26 22:42:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 22:42:17,340 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-26 22:42:17,538 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-26 22:42:17,539 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-10-26 22:42:17,539 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-26 22:42:17,539 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 213 [2020-10-26 22:42:17,539 FATAL L256 erpolLogProxyWrapper]: Heuristic: SHALLOWEST [2020-10-26 22:42:17,539 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-26 22:42:17,540 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-26 22:42:17,540 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-10-26 22:42:17,540 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-26 22:42:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 22:42:17,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908830895] [2020-10-26 22:42:17,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-26 22:42:17,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-26 22:42:17,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115547089] [2020-10-26 22:42:17,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 22:42:17,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-26 22:42:17,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 22:42:17,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 22:42:17,750 INFO L87 Difference]: Start difference. First operand 2754 states and 3552 transitions. Second operand 7 states. [2020-10-26 22:42:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 22:42:21,185 INFO L93 Difference]: Finished difference Result 6144 states and 8083 transitions. [2020-10-26 22:42:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 22:42:21,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2020-10-26 22:42:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 22:42:21,207 INFO L225 Difference]: With dead ends: 6144 [2020-10-26 22:42:21,208 INFO L226 Difference]: Without dead ends: 3774 [2020-10-26 22:42:21,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-26 22:42:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2020-10-26 22:42:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3740. [2020-10-26 22:42:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3740 states. [2020-10-26 22:42:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 4693 transitions. [2020-10-26 22:42:21,334 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 4693 transitions. Word has length 210 [2020-10-26 22:42:21,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 22:42:21,335 INFO L481 AbstractCegarLoop]: Abstraction has 3740 states and 4693 transitions. [2020-10-26 22:42:21,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 22:42:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 4693 transitions. [2020-10-26 22:42:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-10-26 22:42:21,339 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 22:42:21,340 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 22:42:21,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 22:42:21,340 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 22:42:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 22:42:21,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1683812118, now seen corresponding path program 1 times [2020-10-26 22:42:21,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-26 22:42:21,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [464735407] [2020-10-26 22:42:21,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 22:42:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 22:42:21,416 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-26 22:42:21,416 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 22:42:21,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 22:42:21,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:42:21 BoogieIcfgContainer [2020-10-26 22:42:21,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 22:42:21,490 INFO L168 Benchmark]: Toolchain (without parser) took 36487.86 ms. Allocated memory was 125.8 MB in the beginning and 520.1 MB in the end (delta: 394.3 MB). Free memory was 98.4 MB in the beginning and 293.3 MB in the end (delta: -194.9 MB). Peak memory consumption was 200.7 MB. Max. memory is 8.0 GB. [2020-10-26 22:42:21,491 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 125.8 MB. Free memory is still 85.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-26 22:42:21,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 955.27 ms. Allocated memory was 125.8 MB in the beginning and 151.0 MB in the end (delta: 25.2 MB). Free memory was 97.7 MB in the beginning and 112.1 MB in the end (delta: -14.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 8.0 GB. [2020-10-26 22:42:21,499 INFO L168 Benchmark]: Boogie Preprocessor took 187.62 ms. Allocated memory is still 151.0 MB. Free memory was 112.1 MB in the beginning and 104.7 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2020-10-26 22:42:21,499 INFO L168 Benchmark]: RCFGBuilder took 2240.48 ms. Allocated memory is still 151.0 MB. Free memory was 104.7 MB in the beginning and 64.8 MB in the end (delta: 40.0 MB). Peak memory consumption was 66.7 MB. Max. memory is 8.0 GB. [2020-10-26 22:42:21,500 INFO L168 Benchmark]: TraceAbstraction took 33083.15 ms. Allocated memory was 151.0 MB in the beginning and 520.1 MB in the end (delta: 369.1 MB). Free memory was 64.2 MB in the beginning and 293.3 MB in the end (delta: -229.1 MB). Peak memory consumption was 140.0 MB. Max. memory is 8.0 GB. [2020-10-26 22:42:21,512 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.56 ms. Allocated memory is still 125.8 MB. Free memory is still 85.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 955.27 ms. Allocated memory was 125.8 MB in the beginning and 151.0 MB in the end (delta: 25.2 MB). Free memory was 97.7 MB in the beginning and 112.1 MB in the end (delta: -14.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 187.62 ms. Allocated memory is still 151.0 MB. Free memory was 112.1 MB in the beginning and 104.7 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2240.48 ms. Allocated memory is still 151.0 MB. Free memory was 104.7 MB in the beginning and 64.8 MB in the end (delta: 40.0 MB). Peak memory consumption was 66.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 33083.15 ms. Allocated memory was 151.0 MB in the beginning and 520.1 MB in the end (delta: 369.1 MB). Free memory was 64.2 MB in the beginning and 293.3 MB in the end (delta: -229.1 MB). Peak memory consumption was 140.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputA = 1; [L10] int inputD = 4; [L11] int inputB = 2; [L12] int inputE = 5; [L13] int inputF = 6; [L14] int inputC = 3; [L17] int a29 = 130; [L18] int a4 = 1; [L19] int a23 = 312; [L20] int a8 = 15; [L21] int a25 = 10; [L22] int a3 = 1; [L1033] int output = -1; [L1036] COND TRUE 1 [L1039] int input; [L1040] input = __VERIFIER_nondet_int() [L1041] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1044] CALL, EXPR calculate_output(input) [L25] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L28] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L31] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L34] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L37] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L40] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L43] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L46] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L49] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L52] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L55] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L58] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L61] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L64] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L67] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L70] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L73] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L76] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L79] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L82] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L85] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L88] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L91] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L94] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L97] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L100] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L103] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L106] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L109] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L112] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L115] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L118] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L121] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L124] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L127] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L130] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L133] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L136] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L139] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L142] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L145] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L148] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L151] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L154] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L157] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L160] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L163] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L166] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L169] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L172] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L175] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L178] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L181] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L184] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L187] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L190] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L193] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L196] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L199] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L202] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L205] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L209] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L216] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L223] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L229] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L235] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L242] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L249] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L256] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L262] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L267] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L270] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L277] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) [L282] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) [L289] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) [L296] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) [L301] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) [L307] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) [L312] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) [L319] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) [L324] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) [L331] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) [L336] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) [L342] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) [L348] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) [L355] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) [L360] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) [L367] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) [L372] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) [L379] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) [L386] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) [L393] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) [L400] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) [L413] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) [L419] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) [L424] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) [L431] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) [L438] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) [L445] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) [L452] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) [L458] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) [L465] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) [L472] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) [L479] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) [L489] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) [L502] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) [L509] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) [L516] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) [L528] COND TRUE ((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15))) [L529] a29 = (((((a29 % 52)- -193) * 5) % 52)- -169) [L530] a25 = 12 [L532] return 26; [L1044] RET, EXPR calculate_output(input) [L1044] output = calculate_output(input) [L1036] COND TRUE 1 [L1039] int input; [L1040] input = __VERIFIER_nondet_int() [L1041] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1044] CALL, EXPR calculate_output(input) [L25] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L28] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L31] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L34] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L37] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L40] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L43] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L46] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L49] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L52] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L55] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L58] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L61] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L64] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L67] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L70] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L73] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L76] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L79] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L82] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L85] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L88] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L91] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L94] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L97] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L100] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L103] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L106] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L109] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L112] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L115] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L118] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L121] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L124] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L127] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L130] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L133] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L136] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L139] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L142] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L145] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L148] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L151] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L154] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L157] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L160] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L163] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L166] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L169] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L172] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L175] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L178] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L181] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L184] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L187] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L190] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L193] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L196] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L199] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L202] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L205] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L209] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L216] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L223] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L229] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L235] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L242] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L249] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L256] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L262] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L267] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L270] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L277] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) [L282] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) [L289] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) [L296] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) [L301] COND TRUE ( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) )) [L302] a29 = ((((a29 + 107715) * 10)/ 9) - -27123) [L303] a23 = ((((a23 % 90)+ -31) - 5) + 32) [L304] a25 = 11 [L306] return -1; [L1044] RET, EXPR calculate_output(input) [L1044] output = calculate_output(input) [L1036] COND TRUE 1 [L1039] int input; [L1040] input = __VERIFIER_nondet_int() [L1041] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1044] CALL calculate_output(input) [L25] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L28] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L31] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L34] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L37] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L40] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L43] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L46] COND TRUE ((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) [L47] CALL reach_error() [L4] __assert_fail("0", "Problem11_label36.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 296 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.9s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 278 SDtfs, 4404 SDslu, 472 SDs, 0 SdLazy, 7433 SolverSat, 1608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3740occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 118 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 921 NumberOfCodeBlocks, 921 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 695 ConstructedInterpolants, 0 QuantifiedInterpolants, 464765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 134/146 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...