/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=DEEPEST --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/Problem10_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-27 17:26:52,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-27 17:26:52,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-27 17:26:52,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-27 17:26:52,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-27 17:26:52,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-27 17:26:52,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-27 17:26:52,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-27 17:26:52,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-27 17:26:52,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-27 17:26:52,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-27 17:26:52,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-27 17:26:52,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-27 17:26:52,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-27 17:26:52,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-27 17:26:52,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-27 17:26:52,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-27 17:26:52,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-27 17:26:52,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-27 17:26:52,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-27 17:26:52,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-27 17:26:52,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-27 17:26:52,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-27 17:26:52,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-27 17:26:52,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-27 17:26:52,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-27 17:26:52,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-27 17:26:52,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-27 17:26:52,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-27 17:26:52,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-27 17:26:52,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-27 17:26:52,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-27 17:26:52,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-27 17:26:52,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-27 17:26:52,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-27 17:26:52,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-27 17:26:52,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-27 17:26:52,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-27 17:26:52,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-27 17:26:52,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-27 17:26:52,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-27 17:26:52,375 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-27 17:26:52,401 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-27 17:26:52,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-27 17:26:52,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-27 17:26:52,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-27 17:26:52,404 INFO L138 SettingsManager]: * Use SBE=true [2020-10-27 17:26:52,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-27 17:26:52,405 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-27 17:26:52,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-27 17:26:52,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-27 17:26:52,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-27 17:26:52,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-27 17:26:52,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-27 17:26:52,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-27 17:26:52,406 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-27 17:26:52,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-27 17:26:52,407 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-27 17:26:52,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-27 17:26:52,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-27 17:26:52,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-27 17:26:52,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-27 17:26:52,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-27 17:26:52,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-27 17:26:52,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-27 17:26:52,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-27 17:26:52,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-27 17:26:52,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-27 17:26:52,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-27 17:26:52,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-27 17:26:52,409 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-27 17:26:52,410 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=DEEPEST;log-additional-information=true;unknown-allowed=true; [2020-10-27 17:26:52,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-27 17:26:52,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-27 17:26:52,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-27 17:26:52,878 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-27 17:26:52,879 INFO L275 PluginConnector]: CDTParser initialized [2020-10-27 17:26:52,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-10-27 17:26:52,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cb3fea645/26331453ebee4bdfb2cffe7f61d67fa9/FLAG60ac86dd2 [2020-10-27 17:26:53,942 INFO L306 CDTParser]: Found 1 translation units. [2020-10-27 17:26:53,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-10-27 17:26:53,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cb3fea645/26331453ebee4bdfb2cffe7f61d67fa9/FLAG60ac86dd2 [2020-10-27 17:26:54,184 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cb3fea645/26331453ebee4bdfb2cffe7f61d67fa9 [2020-10-27 17:26:54,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-27 17:26:54,196 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-27 17:26:54,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-27 17:26:54,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-27 17:26:54,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-27 17:26:54,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:26:54" (1/1) ... [2020-10-27 17:26:54,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd71d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54, skipping insertion in model container [2020-10-27 17:26:54,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:26:54" (1/1) ... [2020-10-27 17:26:54,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-27 17:26:54,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-27 17:26:54,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-27 17:26:54,752 INFO L203 MainTranslator]: Completed pre-run [2020-10-27 17:26:54,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-27 17:26:54,989 INFO L208 MainTranslator]: Completed translation [2020-10-27 17:26:54,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54 WrapperNode [2020-10-27 17:26:54,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-27 17:26:54,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-27 17:26:54,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-27 17:26:54,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-27 17:26:55,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54" (1/1) ... [2020-10-27 17:26:55,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54" (1/1) ... [2020-10-27 17:26:55,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54" (1/1) ... [2020-10-27 17:26:55,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54" (1/1) ... [2020-10-27 17:26:55,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54" (1/1) ... [2020-10-27 17:26:55,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54" (1/1) ... [2020-10-27 17:26:55,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54" (1/1) ... [2020-10-27 17:26:55,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-27 17:26:55,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-27 17:26:55,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-27 17:26:55,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-27 17:26:55,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54" (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-27 17:26:55,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-27 17:26:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-27 17:26:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-27 17:26:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-27 17:26:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-27 17:26:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-27 17:26:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-27 17:26:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-27 17:26:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-27 17:26:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-27 17:26:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-27 17:26:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-27 17:26:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-27 17:26:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-27 17:26:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-27 17:26:55,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-27 17:26:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-27 17:26:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-27 17:26:55,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-27 17:26:56,671 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-27 17:26:56,671 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-27 17:26:56,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:26:56 BoogieIcfgContainer [2020-10-27 17:26:56,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-27 17:26:56,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-27 17:26:56,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-27 17:26:56,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-27 17:26:56,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:26:54" (1/3) ... [2020-10-27 17:26:56,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e32bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:26:56, skipping insertion in model container [2020-10-27 17:26:56,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:26:54" (2/3) ... [2020-10-27 17:26:56,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e32bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:26:56, skipping insertion in model container [2020-10-27 17:26:56,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:26:56" (3/3) ... [2020-10-27 17:26:56,689 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label15.c [2020-10-27 17:26:56,701 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-27 17:26:56,707 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-27 17:26:56,721 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-27 17:26:56,753 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-27 17:26:56,753 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-27 17:26:56,753 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-27 17:26:56,753 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-27 17:26:56,753 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-27 17:26:56,754 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-27 17:26:56,754 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-27 17:26:56,754 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-27 17:26:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-27 17:26:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-27 17:26:56,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:26:56,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:26:56,787 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:26:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:26:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 596750754, now seen corresponding path program 1 times [2020-10-27 17:26:56,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:26:56,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371677925] [2020-10-27 17:26:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:26:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:56,985 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:57,416 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:57,417 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 27 [2020-10-27 17:26:57,417 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:57,417 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 466 [2020-10-27 17:26:57,419 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:57,420 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-27 17:26:57,420 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-27 17:26:57,420 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 18 [2020-10-27 17:26:57,420 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:26:57,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:26:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:26:57,555 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:26:57,575 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:26:57,575 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:26:57,575 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:26:57,576 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 24 [2020-10-27 17:26:57,576 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:26:57,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:26:57,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:26:57,577 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-27 17:26:57,577 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:26:57,592 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-27 17:26:57,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371677925] [2020-10-27 17:26:57,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-27 17:26:57,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-27 17:26:57,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778646406] [2020-10-27 17:26:57,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-27 17:26:57,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:26:57,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-27 17:26:57,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-27 17:26:57,621 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-27 17:26:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:26:59,752 INFO L93 Difference]: Finished difference Result 586 states and 1012 transitions. [2020-10-27 17:26:59,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:26:59,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-27 17:26:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:26:59,770 INFO L225 Difference]: With dead ends: 586 [2020-10-27 17:26:59,770 INFO L226 Difference]: Without dead ends: 303 [2020-10-27 17:26:59,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:26:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-27 17:26:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-10-27 17:26:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-27 17:26:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 396 transitions. [2020-10-27 17:26:59,880 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 396 transitions. Word has length 17 [2020-10-27 17:26:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:26:59,881 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 396 transitions. [2020-10-27 17:26:59,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-27 17:26:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 396 transitions. [2020-10-27 17:26:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-27 17:26:59,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:26:59,886 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:26:59,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-27 17:26:59,887 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:26:59,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:26:59,888 INFO L82 PathProgramCache]: Analyzing trace with hash -737549697, now seen corresponding path program 1 times [2020-10-27 17:26:59,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:26:59,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [184713285] [2020-10-27 17:26:59,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:26:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:00,016 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:00,214 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:01,013 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:01,014 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-10-27 17:27:01,014 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:27:01,014 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1057 [2020-10-27 17:27:01,015 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:01,016 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:01,016 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-27 17:27:01,016 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 15 [2020-10-27 17:27:01,016 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:27:01,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:01,099 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:01,106 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:01,106 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:01,106 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:01,106 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-27 17:27:01,107 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:01,107 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:01,107 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:01,107 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:01,108 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:01,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:01,154 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:01,218 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:01,218 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:27:01,219 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:01,219 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 78 [2020-10-27 17:27:01,219 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:01,219 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:01,220 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:01,220 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-27 17:27:01,220 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:27:01,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [184713285] [2020-10-27 17:27:01,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:01,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:27:01,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903659456] [2020-10-27 17:27:01,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:27:01,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:01,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:27:01,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:27:01,272 INFO L87 Difference]: Start difference. First operand 299 states and 396 transitions. Second operand 5 states. [2020-10-27 17:27:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:02,767 INFO L93 Difference]: Finished difference Result 741 states and 1023 transitions. [2020-10-27 17:27:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:27:02,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-10-27 17:27:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:02,781 INFO L225 Difference]: With dead ends: 741 [2020-10-27 17:27:02,781 INFO L226 Difference]: Without dead ends: 448 [2020-10-27 17:27:02,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:27:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-27 17:27:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 444. [2020-10-27 17:27:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-27 17:27:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 601 transitions. [2020-10-27 17:27:02,861 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 601 transitions. Word has length 87 [2020-10-27 17:27:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:02,863 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 601 transitions. [2020-10-27 17:27:02,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:27:02,863 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 601 transitions. [2020-10-27 17:27:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-27 17:27:02,873 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:02,873 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-27 17:27:02,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-27 17:27:02,873 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:02,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:02,877 INFO L82 PathProgramCache]: Analyzing trace with hash -109092071, now seen corresponding path program 1 times [2020-10-27 17:27:02,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:02,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [143531627] [2020-10-27 17:27:02,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:02,961 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:03,057 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:03,316 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:04,662 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:04,663 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 106 [2020-10-27 17:27:04,663 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:27:04,663 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1729 [2020-10-27 17:27:04,663 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:04,663 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:04,664 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-27 17:27:04,664 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 15 [2020-10-27 17:27:04,664 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:04,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:04,795 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:04,799 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:04,800 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:04,800 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:04,800 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:27:04,801 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:04,801 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:04,801 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:04,801 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:04,801 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:04,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:04,846 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:04,922 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:04,923 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-27 17:27:04,923 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:04,923 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 87 [2020-10-27 17:27:04,923 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:04,924 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:04,924 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:04,924 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-27 17:27:04,924 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:27:04,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [143531627] [2020-10-27 17:27:04,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:04,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-27 17:27:04,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852784345] [2020-10-27 17:27:05,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-27 17:27:05,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:05,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-27 17:27:05,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:27:05,002 INFO L87 Difference]: Start difference. First operand 444 states and 601 transitions. Second operand 6 states. [2020-10-27 17:27:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:06,575 INFO L93 Difference]: Finished difference Result 1031 states and 1436 transitions. [2020-10-27 17:27:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:27:06,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2020-10-27 17:27:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:06,581 INFO L225 Difference]: With dead ends: 1031 [2020-10-27 17:27:06,582 INFO L226 Difference]: Without dead ends: 593 [2020-10-27 17:27:06,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:27:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-10-27 17:27:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 589. [2020-10-27 17:27:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-10-27 17:27:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 818 transitions. [2020-10-27 17:27:06,619 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 818 transitions. Word has length 94 [2020-10-27 17:27:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:06,620 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 818 transitions. [2020-10-27 17:27:06,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-27 17:27:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 818 transitions. [2020-10-27 17:27:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-10-27 17:27:06,629 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:06,629 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-27 17:27:06,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-27 17:27:06,629 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:06,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:06,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1113851411, now seen corresponding path program 1 times [2020-10-27 17:27:06,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:06,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1008260672] [2020-10-27 17:27:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:06,721 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:06,777 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:07,318 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:08,219 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:08,219 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-27 17:27:08,220 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:27:08,220 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1523 [2020-10-27 17:27:08,220 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:08,220 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:08,220 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 97 [2020-10-27 17:27:08,227 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 15 [2020-10-27 17:27:08,227 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 7 [2020-10-27 17:27:08,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:08,343 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:08,352 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:08,353 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:08,353 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:08,353 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-27 17:27:08,353 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:08,353 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:08,353 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:08,354 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:08,354 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:08,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:08,406 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:08,486 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:08,486 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-27 17:27:08,487 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:08,487 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 94 [2020-10-27 17:27:08,487 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:08,487 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:08,488 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:08,488 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-27 17:27:08,488 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:27:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-27 17:27:08,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1008260672] [2020-10-27 17:27:08,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:08,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:27:08,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246418953] [2020-10-27 17:27:08,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:27:08,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:27:08,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:27:08,556 INFO L87 Difference]: Start difference. First operand 589 states and 818 transitions. Second operand 5 states. [2020-10-27 17:27:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:10,003 INFO L93 Difference]: Finished difference Result 1756 states and 2499 transitions. [2020-10-27 17:27:10,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:27:10,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2020-10-27 17:27:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:10,017 INFO L225 Difference]: With dead ends: 1756 [2020-10-27 17:27:10,018 INFO L226 Difference]: Without dead ends: 1173 [2020-10-27 17:27:10,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:27:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-10-27 17:27:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1169. [2020-10-27 17:27:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2020-10-27 17:27:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1572 transitions. [2020-10-27 17:27:10,075 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1572 transitions. Word has length 104 [2020-10-27 17:27:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:10,077 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1572 transitions. [2020-10-27 17:27:10,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:27:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1572 transitions. [2020-10-27 17:27:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-27 17:27:10,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:10,087 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:27:10,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-27 17:27:10,087 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash -457926990, now seen corresponding path program 1 times [2020-10-27 17:27:10,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:10,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1134461571] [2020-10-27 17:27:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:10,150 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:10,444 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:10,536 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:13,367 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:13,367 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 208 [2020-10-27 17:27:13,367 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:27:13,367 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3238 [2020-10-27 17:27:13,368 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:13,368 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:13,368 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 189 [2020-10-27 17:27:13,368 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 15 [2020-10-27 17:27:13,368 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:13,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:13,461 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:13,466 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:13,466 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:13,467 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:13,467 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:27:13,467 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:13,467 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:13,467 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:13,467 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:13,468 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:13,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:13,488 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:13,515 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:13,515 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-27 17:27:13,515 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:13,515 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 27 [2020-10-27 17:27:13,516 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:13,516 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:13,516 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:13,516 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:13,516 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:13,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-27 17:27:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:13,577 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:13,639 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:13,639 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-27 17:27:13,640 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:13,640 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 75 [2020-10-27 17:27:13,640 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:13,640 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:13,640 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:13,640 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 85 [2020-10-27 17:27:13,641 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-27 17:27:13,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1134461571] [2020-10-27 17:27:13,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:13,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-27 17:27:13,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466054619] [2020-10-27 17:27:13,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-27 17:27:13,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:13,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-27 17:27:13,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-27 17:27:13,745 INFO L87 Difference]: Start difference. First operand 1169 states and 1572 transitions. Second operand 5 states. [2020-10-27 17:27:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:15,111 INFO L93 Difference]: Finished difference Result 1611 states and 2213 transitions. [2020-10-27 17:27:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-27 17:27:15,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 194 [2020-10-27 17:27:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:15,126 INFO L225 Difference]: With dead ends: 1611 [2020-10-27 17:27:15,126 INFO L226 Difference]: Without dead ends: 1608 [2020-10-27 17:27:15,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:27:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2020-10-27 17:27:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1461. [2020-10-27 17:27:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2020-10-27 17:27:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2029 transitions. [2020-10-27 17:27:15,208 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2029 transitions. Word has length 194 [2020-10-27 17:27:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:15,209 INFO L481 AbstractCegarLoop]: Abstraction has 1461 states and 2029 transitions. [2020-10-27 17:27:15,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-27 17:27:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2029 transitions. [2020-10-27 17:27:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2020-10-27 17:27:15,214 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:15,215 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 17:27:15,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-27 17:27:15,215 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:15,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1138370078, now seen corresponding path program 1 times [2020-10-27 17:27:15,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:15,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [170833833] [2020-10-27 17:27:15,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:15,309 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:15,581 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:15,939 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:15,939 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 235 [2020-10-27 17:27:15,939 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:27:15,939 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 664 [2020-10-27 17:27:15,939 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:15,940 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:15,940 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-27 17:27:15,940 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-27 17:27:15,940 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:16,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:16,092 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:16,097 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:16,097 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:16,097 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:16,097 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:27:16,098 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:16,098 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:16,098 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:16,098 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:16,098 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:16,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:16,139 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:16,197 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:16,198 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-27 17:27:16,198 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:16,198 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 68 [2020-10-27 17:27:16,198 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:16,198 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:16,199 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:16,199 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-27 17:27:16,199 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:16,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-27 17:27:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:16,291 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:16,379 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:16,755 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:16,756 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 126 [2020-10-27 17:27:16,756 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:27:16,756 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 493 [2020-10-27 17:27:16,756 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:16,756 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:16,757 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:27:16,757 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-10-27 17:27:16,757 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-27 17:27:17,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [170833833] [2020-10-27 17:27:17,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:17,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:27:17,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644768381] [2020-10-27 17:27:17,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:27:17,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:27:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:27:17,441 INFO L87 Difference]: Start difference. First operand 1461 states and 2029 transitions. Second operand 7 states. [2020-10-27 17:27:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:18,830 INFO L93 Difference]: Finished difference Result 2967 states and 4141 transitions. [2020-10-27 17:27:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-27 17:27:18,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 221 [2020-10-27 17:27:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:18,842 INFO L225 Difference]: With dead ends: 2967 [2020-10-27 17:27:18,842 INFO L226 Difference]: Without dead ends: 1489 [2020-10-27 17:27:18,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-27 17:27:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2020-10-27 17:27:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1465. [2020-10-27 17:27:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2020-10-27 17:27:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2026 transitions. [2020-10-27 17:27:18,917 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2026 transitions. Word has length 221 [2020-10-27 17:27:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:18,917 INFO L481 AbstractCegarLoop]: Abstraction has 1465 states and 2026 transitions. [2020-10-27 17:27:18,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:27:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2026 transitions. [2020-10-27 17:27:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-10-27 17:27:18,924 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:18,924 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-27 17:27:18,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-27 17:27:18,925 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash -769737029, now seen corresponding path program 1 times [2020-10-27 17:27:18,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:18,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643990446] [2020-10-27 17:27:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:19,023 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:19,259 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:20,179 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:20,218 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:20,218 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 300 [2020-10-27 17:27:20,218 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:27:20,219 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1230 [2020-10-27 17:27:20,219 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:20,219 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:20,219 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 154 [2020-10-27 17:27:20,219 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 128 [2020-10-27 17:27:20,219 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:20,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:20,321 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:20,326 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:20,327 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:20,327 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:20,327 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-27 17:27:20,327 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:20,327 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:20,327 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:20,328 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:20,328 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:20,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:20,349 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:20,367 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:20,367 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:27:20,368 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:20,368 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 19 [2020-10-27 17:27:20,368 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:20,368 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:20,368 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:20,368 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:20,369 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:20,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-27 17:27:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:20,408 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:20,458 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:20,458 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-27 17:27:20,458 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:20,458 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 59 [2020-10-27 17:27:20,459 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:20,459 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:20,459 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:20,459 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-10-27 17:27:20,459 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:20,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2020-10-27 17:27:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:20,525 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:20,733 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:20,734 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 126 [2020-10-27 17:27:20,734 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:20,734 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 225 [2020-10-27 17:27:20,734 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:20,734 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:20,735 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:27:20,735 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-10-27 17:27:20,735 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-10-27 17:27:20,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643990446] [2020-10-27 17:27:20,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:20,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:27:20,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545378752] [2020-10-27 17:27:20,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:27:20,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:27:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:27:20,911 INFO L87 Difference]: Start difference. First operand 1465 states and 2026 transitions. Second operand 7 states. [2020-10-27 17:27:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:23,133 INFO L93 Difference]: Finished difference Result 4180 states and 6239 transitions. [2020-10-27 17:27:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-27 17:27:23,133 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 284 [2020-10-27 17:27:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:23,156 INFO L225 Difference]: With dead ends: 4180 [2020-10-27 17:27:23,156 INFO L226 Difference]: Without dead ends: 2721 [2020-10-27 17:27:23,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-27 17:27:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2020-10-27 17:27:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2357. [2020-10-27 17:27:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2357 states. [2020-10-27 17:27:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3128 transitions. [2020-10-27 17:27:23,273 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3128 transitions. Word has length 284 [2020-10-27 17:27:23,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:23,273 INFO L481 AbstractCegarLoop]: Abstraction has 2357 states and 3128 transitions. [2020-10-27 17:27:23,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:27:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3128 transitions. [2020-10-27 17:27:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2020-10-27 17:27:23,282 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:23,283 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:27:23,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-27 17:27:23,283 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:23,284 INFO L82 PathProgramCache]: Analyzing trace with hash 132660719, now seen corresponding path program 1 times [2020-10-27 17:27:23,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:23,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1132966054] [2020-10-27 17:27:23,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:23,377 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:23,786 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:24,715 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:24,716 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 313 [2020-10-27 17:27:24,716 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:27:24,716 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1372 [2020-10-27 17:27:24,716 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:24,716 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:24,717 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-27 17:27:24,717 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 88 [2020-10-27 17:27:24,717 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:24,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:24,798 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:24,803 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:24,803 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:24,803 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:24,803 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:27:24,804 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:24,804 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:24,804 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:24,804 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:24,804 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:24,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:24,837 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:24,879 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:24,880 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-27 17:27:24,880 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:24,880 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 50 [2020-10-27 17:27:24,880 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:24,880 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:24,881 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:24,881 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-27 17:27:24,881 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:24,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-27 17:27:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:24,937 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:25,165 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:25,166 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 86 [2020-10-27 17:27:25,166 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:25,166 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 241 [2020-10-27 17:27:25,167 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:25,167 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:25,167 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:27:25,168 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 86 [2020-10-27 17:27:25,168 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:27:25,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-10-27 17:27:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:25,308 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:25,404 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:25,404 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 126 [2020-10-27 17:27:25,404 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:25,405 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 118 [2020-10-27 17:27:25,405 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:25,406 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:25,407 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 123 [2020-10-27 17:27:25,407 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:25,407 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-27 17:27:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 98 proven. 84 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-27 17:27:25,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1132966054] [2020-10-27 17:27:25,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:25,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-27 17:27:25,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12929708] [2020-10-27 17:27:25,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-27 17:27:25,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:25,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-27 17:27:25,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-27 17:27:25,622 INFO L87 Difference]: Start difference. First operand 2357 states and 3128 transitions. Second operand 7 states. [2020-10-27 17:27:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:27,460 INFO L93 Difference]: Finished difference Result 5320 states and 7116 transitions. [2020-10-27 17:27:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-27 17:27:27,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 297 [2020-10-27 17:27:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:27,478 INFO L225 Difference]: With dead ends: 5320 [2020-10-27 17:27:27,478 INFO L226 Difference]: Without dead ends: 2969 [2020-10-27 17:27:27,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-27 17:27:27,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-10-27 17:27:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2383. [2020-10-27 17:27:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2383 states. [2020-10-27 17:27:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 2826 transitions. [2020-10-27 17:27:27,590 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 2826 transitions. Word has length 297 [2020-10-27 17:27:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:27,591 INFO L481 AbstractCegarLoop]: Abstraction has 2383 states and 2826 transitions. [2020-10-27 17:27:27,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-27 17:27:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2826 transitions. [2020-10-27 17:27:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2020-10-27 17:27:27,600 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:27,601 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:27:27,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-27 17:27:27,602 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1807570823, now seen corresponding path program 1 times [2020-10-27 17:27:27,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:27,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1278927153] [2020-10-27 17:27:27,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:27,665 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:27,796 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:27,898 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:32,651 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:32,652 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 327 [2020-10-27 17:27:32,653 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-27 17:27:32,653 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5005 [2020-10-27 17:27:32,653 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:32,654 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:32,654 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 181 [2020-10-27 17:27:32,654 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 19 [2020-10-27 17:27:32,654 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-27 17:27:32,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-27 17:27:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:32,819 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:32,824 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:32,824 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-27 17:27:32,824 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:32,825 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-27 17:27:32,825 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:32,825 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:32,825 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:32,825 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:32,825 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:32,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-27 17:27:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:32,854 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:32,880 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:32,880 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-27 17:27:32,880 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:32,881 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 27 [2020-10-27 17:27:32,881 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:32,881 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-27 17:27:32,881 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:32,881 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-27 17:27:32,881 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:32,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-27 17:27:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:32,942 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:33,042 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:33,042 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 83 [2020-10-27 17:27:33,042 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-27 17:27:33,043 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 111 [2020-10-27 17:27:33,043 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:33,043 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-27 17:27:33,043 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-27 17:27:33,043 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 77 [2020-10-27 17:27:33,043 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:33,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-10-27 17:27:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-27 17:27:33,121 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:33,179 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-27 17:27:33,377 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-27 17:27:33,378 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 126 [2020-10-27 17:27:33,378 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-27 17:27:33,378 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 275 [2020-10-27 17:27:33,378 FATAL L256 erpolLogProxyWrapper]: Heuristic: DEEPEST [2020-10-27 17:27:33,379 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-27 17:27:33,379 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-27 17:27:33,379 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-10-27 17:27:33,379 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-27 17:27:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 195 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-10-27 17:27:34,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1278927153] [2020-10-27 17:27:34,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-27 17:27:34,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-27 17:27:34,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950395010] [2020-10-27 17:27:34,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-27 17:27:34,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-27 17:27:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-27 17:27:34,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-27 17:27:34,153 INFO L87 Difference]: Start difference. First operand 2383 states and 2826 transitions. Second operand 6 states. [2020-10-27 17:27:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-27 17:27:35,521 INFO L93 Difference]: Finished difference Result 4791 states and 5725 transitions. [2020-10-27 17:27:35,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-27 17:27:35,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 311 [2020-10-27 17:27:35,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-27 17:27:35,534 INFO L225 Difference]: With dead ends: 4791 [2020-10-27 17:27:35,534 INFO L226 Difference]: Without dead ends: 2398 [2020-10-27 17:27:35,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-27 17:27:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2020-10-27 17:27:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2381. [2020-10-27 17:27:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2020-10-27 17:27:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2817 transitions. [2020-10-27 17:27:35,613 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2817 transitions. Word has length 311 [2020-10-27 17:27:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-27 17:27:35,614 INFO L481 AbstractCegarLoop]: Abstraction has 2381 states and 2817 transitions. [2020-10-27 17:27:35,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-27 17:27:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2817 transitions. [2020-10-27 17:27:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2020-10-27 17:27:35,624 INFO L414 BasicCegarLoop]: Found error trace [2020-10-27 17:27:35,624 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-27 17:27:35,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-27 17:27:35,625 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-27 17:27:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-27 17:27:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash -274451307, now seen corresponding path program 1 times [2020-10-27 17:27:35,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-27 17:27:35,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [965197285] [2020-10-27 17:27:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-27 17:27:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-27 17:27:35,718 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-27 17:27:35,719 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-27 17:27:35,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-27 17:27:35,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:27:35 BoogieIcfgContainer [2020-10-27 17:27:35,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-27 17:27:35,808 INFO L168 Benchmark]: Toolchain (without parser) took 41616.16 ms. Allocated memory was 125.8 MB in the beginning and 750.8 MB in the end (delta: 625.0 MB). Free memory was 100.1 MB in the beginning and 428.6 MB in the end (delta: -328.5 MB). Peak memory consumption was 296.6 MB. Max. memory is 8.0 GB. [2020-10-27 17:27:35,808 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 125.8 MB. Free memory is still 86.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-27 17:27:35,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.26 ms. Allocated memory was 125.8 MB in the beginning and 166.7 MB in the end (delta: 40.9 MB). Free memory was 99.5 MB in the beginning and 146.7 MB in the end (delta: -47.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 8.0 GB. [2020-10-27 17:27:35,810 INFO L168 Benchmark]: Boogie Preprocessor took 141.57 ms. Allocated memory is still 166.7 MB. Free memory was 146.7 MB in the beginning and 142.3 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-10-27 17:27:35,811 INFO L168 Benchmark]: RCFGBuilder took 1540.19 ms. Allocated memory is still 166.7 MB. Free memory was 142.3 MB in the beginning and 138.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 55.0 MB. Max. memory is 8.0 GB. [2020-10-27 17:27:35,812 INFO L168 Benchmark]: TraceAbstraction took 39129.92 ms. Allocated memory was 166.7 MB in the beginning and 750.8 MB in the end (delta: 584.1 MB). Free memory was 138.1 MB in the beginning and 428.6 MB in the end (delta: -290.5 MB). Peak memory consumption was 293.1 MB. Max. memory is 8.0 GB. [2020-10-27 17:27:35,815 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.24 ms. Allocated memory is still 125.8 MB. Free memory is still 86.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 792.26 ms. Allocated memory was 125.8 MB in the beginning and 166.7 MB in the end (delta: 40.9 MB). Free memory was 99.5 MB in the beginning and 146.7 MB in the end (delta: -47.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 141.57 ms. Allocated memory is still 166.7 MB. Free memory was 146.7 MB in the beginning and 142.3 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1540.19 ms. Allocated memory is still 166.7 MB. Free memory was 142.3 MB in the beginning and 138.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 55.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 39129.92 ms. Allocated memory was 166.7 MB in the beginning and 750.8 MB in the end (delta: 584.1 MB). Free memory was 138.1 MB in the beginning and 428.6 MB in the end (delta: -290.5 MB). Peak memory consumption was 293.1 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 inputC = 3; [L10] int inputD = 4; [L11] int inputE = 5; [L12] int inputF = 6; [L13] int inputB = 2; [L16] int a1 = 23; [L17] int a19 = 9; [L18] int a10 = 0; [L19] int a12 = 0; [L20] int a4 = 14; [L581] int output = -1; [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L428] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L429] a10 = 1 [L431] return 25; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L289] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L290] a19 = 10 [L292] return 25; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L432] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L438] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L444] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L450] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L456] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L462] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L467] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L473] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L478] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L483] COND TRUE (((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)) [L484] a1 = ((((a1 * 10)/ -9) * 5) - 333686) [L485] a10 = 4 [L486] a19 = 6 [L488] return -1; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)) [L36] CALL reach_error() [L4] __assert_fail("0", "Problem10_label15.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 38.9s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 231 SDtfs, 3383 SDslu, 231 SDs, 0 SdLazy, 6650 SolverSat, 1115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2383occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 1154 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 1951 NumberOfCodeBlocks, 1951 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1600 ConstructedInterpolants, 0 QuantifiedInterpolants, 2043823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 903/998 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...