/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=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.3 --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_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-29 06:38:20,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-29 06:38:20,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-29 06:38:20,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-29 06:38:20,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-29 06:38:20,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-29 06:38:20,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-29 06:38:20,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-29 06:38:20,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-29 06:38:20,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-29 06:38:20,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-29 06:38:20,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-29 06:38:20,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-29 06:38:20,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-29 06:38:20,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-29 06:38:20,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-29 06:38:20,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-29 06:38:20,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-29 06:38:20,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-29 06:38:20,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-29 06:38:20,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-29 06:38:20,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-29 06:38:20,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-29 06:38:20,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-29 06:38:20,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-29 06:38:20,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-29 06:38:20,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-29 06:38:20,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-29 06:38:20,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-29 06:38:20,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-29 06:38:20,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-29 06:38:20,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-29 06:38:20,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-29 06:38:20,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-29 06:38:20,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-29 06:38:20,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-29 06:38:20,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-29 06:38:20,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-29 06:38:20,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-29 06:38:20,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-29 06:38:20,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-29 06:38:20,274 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-29 06:38:20,309 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-29 06:38:20,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-29 06:38:20,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-29 06:38:20,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-29 06:38:20,312 INFO L138 SettingsManager]: * Use SBE=true [2020-10-29 06:38:20,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-29 06:38:20,312 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-29 06:38:20,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-29 06:38:20,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-29 06:38:20,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-29 06:38:20,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-29 06:38:20,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-29 06:38:20,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-29 06:38:20,314 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-29 06:38:20,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-29 06:38:20,314 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-29 06:38:20,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-29 06:38:20,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-29 06:38:20,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-29 06:38:20,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-29 06:38:20,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-29 06:38:20,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-29 06:38:20,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-29 06:38:20,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-29 06:38:20,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-29 06:38:20,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-29 06:38:20,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-29 06:38:20,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-29 06:38:20,317 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-29 06:38:20,317 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=SMALLESTAMONGWIDE;tolerance=0.3;log-additional-information=true;unknown-allowed=true; [2020-10-29 06:38:20,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-29 06:38:20,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-29 06:38:20,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-29 06:38:20,753 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-29 06:38:20,754 INFO L275 PluginConnector]: CDTParser initialized [2020-10-29 06:38:20,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label12.c [2020-10-29 06:38:20,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f7f5bce9b/dc7bf36da03549e8a0534a30801a616d/FLAG6c2d99b5d [2020-10-29 06:38:21,590 INFO L306 CDTParser]: Found 1 translation units. [2020-10-29 06:38:21,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label12.c [2020-10-29 06:38:21,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f7f5bce9b/dc7bf36da03549e8a0534a30801a616d/FLAG6c2d99b5d [2020-10-29 06:38:21,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f7f5bce9b/dc7bf36da03549e8a0534a30801a616d [2020-10-29 06:38:21,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-29 06:38:21,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-29 06:38:21,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-29 06:38:21,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-29 06:38:21,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-29 06:38:21,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 06:38:21" (1/1) ... [2020-10-29 06:38:21,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b90f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:21, skipping insertion in model container [2020-10-29 06:38:21,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 06:38:21" (1/1) ... [2020-10-29 06:38:21,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-29 06:38:21,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-29 06:38:22,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-29 06:38:22,584 INFO L203 MainTranslator]: Completed pre-run [2020-10-29 06:38:22,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-29 06:38:22,873 INFO L208 MainTranslator]: Completed translation [2020-10-29 06:38:22,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:22 WrapperNode [2020-10-29 06:38:22,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-29 06:38:22,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-29 06:38:22,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-29 06:38:22,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-29 06:38:22,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:22" (1/1) ... [2020-10-29 06:38:22,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:22" (1/1) ... [2020-10-29 06:38:22,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:22" (1/1) ... [2020-10-29 06:38:22,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:22" (1/1) ... [2020-10-29 06:38:23,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:22" (1/1) ... [2020-10-29 06:38:23,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:22" (1/1) ... [2020-10-29 06:38:23,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:22" (1/1) ... [2020-10-29 06:38:23,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-29 06:38:23,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-29 06:38:23,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-29 06:38:23,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-29 06:38:23,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:22" (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-29 06:38:23,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-29 06:38:23,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-29 06:38:23,151 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-29 06:38:23,151 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-29 06:38:23,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-29 06:38:23,151 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-29 06:38:23,151 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-29 06:38:23,152 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-29 06:38:23,152 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-29 06:38:23,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-29 06:38:23,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-29 06:38:23,152 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-29 06:38:23,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-29 06:38:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-29 06:38:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-29 06:38:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-29 06:38:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-29 06:38:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-29 06:38:23,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-29 06:38:25,103 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-29 06:38:25,104 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-29 06:38:25,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 06:38:25 BoogieIcfgContainer [2020-10-29 06:38:25,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-29 06:38:25,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-29 06:38:25,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-29 06:38:25,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-29 06:38:25,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 06:38:21" (1/3) ... [2020-10-29 06:38:25,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d97811e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 06:38:25, skipping insertion in model container [2020-10-29 06:38:25,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:38:22" (2/3) ... [2020-10-29 06:38:25,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d97811e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 06:38:25, skipping insertion in model container [2020-10-29 06:38:25,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 06:38:25" (3/3) ... [2020-10-29 06:38:25,117 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label12.c [2020-10-29 06:38:25,131 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-29 06:38:25,137 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-29 06:38:25,152 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-29 06:38:25,183 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-29 06:38:25,184 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-29 06:38:25,184 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-29 06:38:25,184 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-29 06:38:25,184 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-29 06:38:25,184 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-29 06:38:25,185 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-29 06:38:25,185 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-29 06:38:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-29 06:38:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-29 06:38:25,215 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:38:25,216 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:38:25,217 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:38:25,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:38:25,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2066663958, now seen corresponding path program 1 times [2020-10-29 06:38:25,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:38:25,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [336884668] [2020-10-29 06:38:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:38:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:25,497 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:26,001 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:26,002 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 29 [2020-10-29 06:38:26,002 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:26,003 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 568 [2020-10-29 06:38:26,005 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:26,006 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:26,006 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-29 06:38:26,006 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-29 06:38:26,007 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 20 [2020-10-29 06:38:26,007 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-10-29 06:38:26,184 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-29 06:38:26,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:38:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:26,216 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:26,256 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:26,256 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:38:26,257 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:26,258 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 47 [2020-10-29 06:38:26,258 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:26,258 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:26,258 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:38:26,259 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:26,259 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-29 06:38:26,259 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:38:26,279 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-29 06:38:26,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [336884668] [2020-10-29 06:38:26,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-29 06:38:26,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-29 06:38:26,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464710018] [2020-10-29 06:38:26,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-29 06:38:26,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:38:26,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-29 06:38:26,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-29 06:38:26,315 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-29 06:38:26,489 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-29 06:38:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:38:28,718 INFO L93 Difference]: Finished difference Result 586 states and 1013 transitions. [2020-10-29 06:38:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-29 06:38:28,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-29 06:38:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:38:28,739 INFO L225 Difference]: With dead ends: 586 [2020-10-29 06:38:28,739 INFO L226 Difference]: Without dead ends: 303 [2020-10-29 06:38:28,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-29 06:38:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-29 06:38:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2020-10-29 06:38:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-10-29 06:38:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 424 transitions. [2020-10-29 06:38:28,832 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 424 transitions. Word has length 19 [2020-10-29 06:38:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:38:28,833 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 424 transitions. [2020-10-29 06:38:28,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-29 06:38:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 424 transitions. [2020-10-29 06:38:28,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-29 06:38:28,838 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:38:28,838 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:38:28,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-29 06:38:28,839 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:38:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:38:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1489360533, now seen corresponding path program 1 times [2020-10-29 06:38:28,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:38:28,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [159951764] [2020-10-29 06:38:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:38:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:28,912 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:29,125 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:29,722 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:30,101 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:30,102 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 103 [2020-10-29 06:38:30,102 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-29 06:38:30,102 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1214 [2020-10-29 06:38:30,104 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:30,104 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:30,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-29 06:38:30,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-29 06:38:30,105 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 78 [2020-10-29 06:38:30,105 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-29 06:38:30,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:38:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:30,204 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:30,222 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:30,223 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:38:30,223 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:30,223 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 31 [2020-10-29 06:38:30,223 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:30,225 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:30,225 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:38:30,226 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:30,226 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-29 06:38:30,232 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 8 [2020-10-29 06:38:30,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:38:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:30,289 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:30,392 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:30,393 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 73 [2020-10-29 06:38:30,393 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:30,393 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 113 [2020-10-29 06:38:30,393 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:30,393 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:30,394 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:30,394 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:38:30,394 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 73 [2020-10-29 06:38:30,394 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:38:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-29 06:38:30,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [159951764] [2020-10-29 06:38:30,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-29 06:38:30,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-29 06:38:30,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245754052] [2020-10-29 06:38:30,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:38:30,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:38:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:38:30,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:38:30,482 INFO L87 Difference]: Start difference. First operand 297 states and 424 transitions. Second operand 7 states. [2020-10-29 06:38:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:38:32,359 INFO L93 Difference]: Finished difference Result 914 states and 1340 transitions. [2020-10-29 06:38:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-29 06:38:32,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2020-10-29 06:38:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:38:32,368 INFO L225 Difference]: With dead ends: 914 [2020-10-29 06:38:32,368 INFO L226 Difference]: Without dead ends: 623 [2020-10-29 06:38:32,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-29 06:38:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-10-29 06:38:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 597. [2020-10-29 06:38:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-29 06:38:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 767 transitions. [2020-10-29 06:38:32,437 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 767 transitions. Word has length 91 [2020-10-29 06:38:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:38:32,437 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 767 transitions. [2020-10-29 06:38:32,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:38:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 767 transitions. [2020-10-29 06:38:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-29 06:38:32,442 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:38:32,442 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:38:32,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-29 06:38:32,442 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:38:32,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:38:32,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1000520635, now seen corresponding path program 1 times [2020-10-29 06:38:32,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:38:32,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [588644225] [2020-10-29 06:38:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:38:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:32,500 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:32,710 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:32,710 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 110 [2020-10-29 06:38:32,711 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:32,711 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 229 [2020-10-29 06:38:32,711 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:32,711 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:32,711 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:32,711 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-29 06:38:32,712 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-29 06:38:32,712 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:32,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:38:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:32,818 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:32,821 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:32,822 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:38:32,822 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:32,822 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-29 06:38:32,822 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:32,822 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:32,822 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:38:32,823 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:32,823 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:38:32,823 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:32,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:38:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:32,876 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:32,940 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:32,940 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-29 06:38:32,940 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:32,941 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 78 [2020-10-29 06:38:32,941 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:32,941 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:32,941 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:38:32,941 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:32,941 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-29 06:38:32,942 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-29 06:38:32,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [588644225] [2020-10-29 06:38:32,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:38:32,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-29 06:38:32,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181165366] [2020-10-29 06:38:32,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-29 06:38:32,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:38:33,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-29 06:38:33,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-29 06:38:33,001 INFO L87 Difference]: Start difference. First operand 597 states and 767 transitions. Second operand 5 states. [2020-10-29 06:38:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:38:34,428 INFO L93 Difference]: Finished difference Result 1486 states and 2000 transitions. [2020-10-29 06:38:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-29 06:38:34,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-10-29 06:38:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:38:34,445 INFO L225 Difference]: With dead ends: 1486 [2020-10-29 06:38:34,445 INFO L226 Difference]: Without dead ends: 895 [2020-10-29 06:38:34,449 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-29 06:38:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2020-10-29 06:38:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 891. [2020-10-29 06:38:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2020-10-29 06:38:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1156 transitions. [2020-10-29 06:38:34,535 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1156 transitions. Word has length 98 [2020-10-29 06:38:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:38:34,538 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1156 transitions. [2020-10-29 06:38:34,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-29 06:38:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1156 transitions. [2020-10-29 06:38:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-10-29 06:38:34,557 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:38:34,558 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:38:34,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-29 06:38:34,558 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:38:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:38:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1400977410, now seen corresponding path program 1 times [2020-10-29 06:38:34,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:38:34,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1410184010] [2020-10-29 06:38:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:38:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:34,671 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:34,951 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:35,226 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:35,461 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:36,472 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:36,472 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 185 [2020-10-29 06:38:36,473 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-29 06:38:36,473 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1838 [2020-10-29 06:38:36,473 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:36,473 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:36,473 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:36,474 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-29 06:38:36,474 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-29 06:38:36,474 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:36,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:38:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:36,603 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:36,614 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:36,614 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:38:36,615 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:36,615 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-10-29 06:38:36,615 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:36,615 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:36,615 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:38:36,616 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:36,616 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:38:36,616 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:38:36,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:38:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:36,701 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:36,760 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:36,761 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-29 06:38:36,762 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:36,762 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 70 [2020-10-29 06:38:36,762 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:36,762 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:36,762 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:38:36,763 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:36,763 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-29 06:38:36,763 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:38:36,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-29 06:38:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:36,837 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:36,957 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:36,957 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-29 06:38:36,958 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:36,958 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 131 [2020-10-29 06:38:36,958 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:36,958 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:36,959 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:36,959 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:38:36,959 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-29 06:38:36,959 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:38:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:38:37,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1410184010] [2020-10-29 06:38:37,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:38:37,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-29 06:38:37,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167537625] [2020-10-29 06:38:37,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-29 06:38:37,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:38:37,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-29 06:38:37,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-29 06:38:37,055 INFO L87 Difference]: Start difference. First operand 891 states and 1156 transitions. Second operand 8 states. [2020-10-29 06:38:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:38:39,444 INFO L93 Difference]: Finished difference Result 2100 states and 2752 transitions. [2020-10-29 06:38:39,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-29 06:38:39,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2020-10-29 06:38:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:38:39,452 INFO L225 Difference]: With dead ends: 2100 [2020-10-29 06:38:39,453 INFO L226 Difference]: Without dead ends: 919 [2020-10-29 06:38:39,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-10-29 06:38:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2020-10-29 06:38:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 899. [2020-10-29 06:38:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2020-10-29 06:38:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1054 transitions. [2020-10-29 06:38:39,499 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1054 transitions. Word has length 171 [2020-10-29 06:38:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:38:39,500 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 1054 transitions. [2020-10-29 06:38:39,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-29 06:38:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1054 transitions. [2020-10-29 06:38:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-29 06:38:39,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:38:39,504 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:38:39,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-29 06:38:39,505 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:38:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:38:39,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1107541812, now seen corresponding path program 1 times [2020-10-29 06:38:39,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:38:39,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [652500707] [2020-10-29 06:38:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:38:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:39,577 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:39,745 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:40,306 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:40,578 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:40,578 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 193 [2020-10-29 06:38:40,578 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-29 06:38:40,579 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1029 [2020-10-29 06:38:40,579 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:40,579 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:40,579 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:40,579 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-29 06:38:40,579 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-29 06:38:40,580 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:40,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:38:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:40,662 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:40,669 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:40,669 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:38:40,670 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:40,670 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-29 06:38:40,670 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:40,670 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:40,670 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:38:40,670 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:40,671 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:38:40,671 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:40,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:38:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:40,708 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:40,752 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:40,753 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-29 06:38:40,753 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:40,753 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 54 [2020-10-29 06:38:40,753 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:40,753 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:40,754 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:38:40,754 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:40,754 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-29 06:38:40,754 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:40,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-29 06:38:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:40,808 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:40,951 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:40,951 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-29 06:38:40,952 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:40,952 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 155 [2020-10-29 06:38:40,952 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:40,952 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:40,952 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:40,953 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:38:40,953 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-29 06:38:40,953 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:38:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:38:41,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [652500707] [2020-10-29 06:38:41,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:38:41,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:38:41,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030005831] [2020-10-29 06:38:41,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:38:41,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:38:41,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:38:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:38:41,100 INFO L87 Difference]: Start difference. First operand 899 states and 1054 transitions. Second operand 7 states. [2020-10-29 06:38:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:38:42,809 INFO L93 Difference]: Finished difference Result 2118 states and 2505 transitions. [2020-10-29 06:38:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-29 06:38:42,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2020-10-29 06:38:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:38:42,820 INFO L225 Difference]: With dead ends: 2118 [2020-10-29 06:38:42,820 INFO L226 Difference]: Without dead ends: 1072 [2020-10-29 06:38:42,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-29 06:38:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2020-10-29 06:38:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1050. [2020-10-29 06:38:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2020-10-29 06:38:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1212 transitions. [2020-10-29 06:38:42,875 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1212 transitions. Word has length 179 [2020-10-29 06:38:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:38:42,876 INFO L481 AbstractCegarLoop]: Abstraction has 1050 states and 1212 transitions. [2020-10-29 06:38:42,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:38:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1212 transitions. [2020-10-29 06:38:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-10-29 06:38:42,880 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:38:42,880 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:38:42,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-29 06:38:42,881 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:38:42,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:38:42,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1442538970, now seen corresponding path program 1 times [2020-10-29 06:38:42,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:38:42,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [951901026] [2020-10-29 06:38:42,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:38:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:42,956 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:43,024 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:43,901 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:45,721 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:45,741 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 200 [2020-10-29 06:38:45,742 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-29 06:38:45,742 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2795 [2020-10-29 06:38:45,742 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:45,742 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:45,743 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:45,743 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-29 06:38:45,743 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-29 06:38:45,743 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:45,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:38:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:45,829 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:45,833 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:45,833 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:38:45,833 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:45,833 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-29 06:38:45,834 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:45,834 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:45,834 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:38:45,834 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:45,834 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:38:45,835 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:45,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:38:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:45,875 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:45,933 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:45,934 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-29 06:38:45,934 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:45,934 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 68 [2020-10-29 06:38:45,934 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:45,934 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:45,934 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:38:45,935 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:45,935 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-29 06:38:45,935 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:45,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-29 06:38:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:45,987 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:46,090 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:46,090 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-29 06:38:46,091 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:46,091 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 114 [2020-10-29 06:38:46,091 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:46,091 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:46,091 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:46,092 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:38:46,092 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-29 06:38:46,092 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:38:46,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [951901026] [2020-10-29 06:38:46,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:38:46,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:38:46,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119872988] [2020-10-29 06:38:46,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:38:46,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:38:46,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:38:46,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:38:46,208 INFO L87 Difference]: Start difference. First operand 1050 states and 1212 transitions. Second operand 7 states. [2020-10-29 06:38:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:38:47,898 INFO L93 Difference]: Finished difference Result 2408 states and 2810 transitions. [2020-10-29 06:38:47,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-29 06:38:47,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 186 [2020-10-29 06:38:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:38:47,909 INFO L225 Difference]: With dead ends: 2408 [2020-10-29 06:38:47,910 INFO L226 Difference]: Without dead ends: 1364 [2020-10-29 06:38:47,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-29 06:38:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-10-29 06:38:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1201. [2020-10-29 06:38:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2020-10-29 06:38:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1386 transitions. [2020-10-29 06:38:47,978 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1386 transitions. Word has length 186 [2020-10-29 06:38:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:38:47,978 INFO L481 AbstractCegarLoop]: Abstraction has 1201 states and 1386 transitions. [2020-10-29 06:38:47,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:38:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1386 transitions. [2020-10-29 06:38:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2020-10-29 06:38:47,982 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:38:47,983 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:38:47,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-29 06:38:47,983 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:38:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:38:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash 76837626, now seen corresponding path program 1 times [2020-10-29 06:38:47,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:38:47,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [744269988] [2020-10-29 06:38:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:38:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:48,082 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:48,462 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:48,723 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:50,066 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:51,331 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:51,331 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 210 [2020-10-29 06:38:51,332 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-29 06:38:51,332 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3281 [2020-10-29 06:38:51,332 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:51,332 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:51,332 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:51,333 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 97 [2020-10-29 06:38:51,333 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-29 06:38:51,333 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:51,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:38:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:51,431 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:51,435 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:51,436 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:38:51,436 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:51,436 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-29 06:38:51,436 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:51,437 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:51,437 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:38:51,437 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:51,437 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:38:51,437 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:51,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:38:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:51,481 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:51,558 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:51,558 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-29 06:38:51,558 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:51,559 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 87 [2020-10-29 06:38:51,559 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:51,559 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:51,560 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:38:51,560 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:51,560 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-29 06:38:51,560 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:38:51,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-29 06:38:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:51,642 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:51,748 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:51,749 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-29 06:38:51,749 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:51,749 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 118 [2020-10-29 06:38:51,749 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:51,749 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:51,750 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:51,750 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:38:51,750 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-29 06:38:51,751 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 106 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:38:51,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [744269988] [2020-10-29 06:38:51,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:38:51,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:38:51,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659196028] [2020-10-29 06:38:51,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:38:51,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:38:51,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:38:51,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:38:51,890 INFO L87 Difference]: Start difference. First operand 1201 states and 1386 transitions. Second operand 7 states. [2020-10-29 06:38:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:38:53,850 INFO L93 Difference]: Finished difference Result 3439 states and 4049 transitions. [2020-10-29 06:38:53,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-29 06:38:53,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2020-10-29 06:38:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:38:53,865 INFO L225 Difference]: With dead ends: 3439 [2020-10-29 06:38:53,866 INFO L226 Difference]: Without dead ends: 2099 [2020-10-29 06:38:53,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-29 06:38:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2020-10-29 06:38:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1789. [2020-10-29 06:38:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2020-10-29 06:38:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2049 transitions. [2020-10-29 06:38:53,934 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2049 transitions. Word has length 196 [2020-10-29 06:38:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:38:53,934 INFO L481 AbstractCegarLoop]: Abstraction has 1789 states and 2049 transitions. [2020-10-29 06:38:53,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:38:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2049 transitions. [2020-10-29 06:38:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-10-29 06:38:53,939 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:38:53,939 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:38:53,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-29 06:38:53,939 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:38:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:38:53,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1662355776, now seen corresponding path program 1 times [2020-10-29 06:38:53,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:38:53,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [439593567] [2020-10-29 06:38:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:38:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:53,998 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:54,240 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:54,474 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:55,479 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:57,398 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:57,399 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 219 [2020-10-29 06:38:57,399 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-29 06:38:57,399 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3420 [2020-10-29 06:38:57,399 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:57,400 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:57,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:57,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 106 [2020-10-29 06:38:57,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-29 06:38:57,400 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:57,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:38:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:57,489 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:57,493 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:57,493 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:38:57,493 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:57,494 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-29 06:38:57,494 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:57,494 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:57,494 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:38:57,494 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:57,494 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:38:57,495 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:38:57,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:38:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:57,551 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:57,646 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:57,647 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-29 06:38:57,647 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:57,647 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 113 [2020-10-29 06:38:57,648 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:57,648 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:57,648 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:38:57,649 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:38:57,649 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-29 06:38:57,649 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:38:57,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-29 06:38:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:57,743 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:38:57,914 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:38:57,914 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-29 06:38:57,915 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:38:57,915 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 189 [2020-10-29 06:38:57,915 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:38:57,915 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:38:57,916 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:38:57,916 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:38:57,916 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-29 06:38:57,917 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:38:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:38:58,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [439593567] [2020-10-29 06:38:58,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:38:58,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:38:58,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75028653] [2020-10-29 06:38:58,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:38:58,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:38:58,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:38:58,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:38:58,068 INFO L87 Difference]: Start difference. First operand 1789 states and 2049 transitions. Second operand 7 states. [2020-10-29 06:38:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:38:59,670 INFO L93 Difference]: Finished difference Result 4599 states and 5360 transitions. [2020-10-29 06:38:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-29 06:38:59,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 205 [2020-10-29 06:38:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:38:59,687 INFO L225 Difference]: With dead ends: 4599 [2020-10-29 06:38:59,687 INFO L226 Difference]: Without dead ends: 2816 [2020-10-29 06:38:59,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-29 06:38:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2020-10-29 06:38:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2377. [2020-10-29 06:38:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2020-10-29 06:38:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 2775 transitions. [2020-10-29 06:38:59,774 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 2775 transitions. Word has length 205 [2020-10-29 06:38:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:38:59,774 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 2775 transitions. [2020-10-29 06:38:59,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:38:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 2775 transitions. [2020-10-29 06:38:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-10-29 06:38:59,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:38:59,780 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:38:59,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-29 06:38:59,780 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:38:59,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:38:59,781 INFO L82 PathProgramCache]: Analyzing trace with hash 657143326, now seen corresponding path program 1 times [2020-10-29 06:38:59,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:38:59,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [895135066] [2020-10-29 06:38:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:38:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:38:59,831 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:00,104 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:00,897 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:00,897 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 229 [2020-10-29 06:39:00,898 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-29 06:39:00,898 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1083 [2020-10-29 06:39:00,898 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:00,898 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:00,898 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:39:00,898 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-29 06:39:00,899 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 122 [2020-10-29 06:39:00,899 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:00,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:39:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:00,989 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:00,992 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:00,993 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:39:00,993 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:00,993 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-29 06:39:00,993 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:00,993 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:00,994 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:39:00,994 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:39:00,994 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:39:00,994 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:01,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:39:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:01,030 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:01,086 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:01,086 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-29 06:39:01,086 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:01,086 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 64 [2020-10-29 06:39:01,087 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:01,087 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:01,087 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:39:01,087 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:39:01,087 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-29 06:39:01,087 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:01,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-29 06:39:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:01,162 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:01,334 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:01,334 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-29 06:39:01,334 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:01,334 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 188 [2020-10-29 06:39:01,335 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:01,335 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:01,335 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:39:01,335 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:39:01,335 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-29 06:39:01,336 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:39:01,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [895135066] [2020-10-29 06:39:01,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:39:01,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:39:01,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634580824] [2020-10-29 06:39:01,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:39:01,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:39:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:39:01,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:39:01,525 INFO L87 Difference]: Start difference. First operand 2377 states and 2775 transitions. Second operand 7 states. [2020-10-29 06:39:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:39:03,539 INFO L93 Difference]: Finished difference Result 5273 states and 6387 transitions. [2020-10-29 06:39:03,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-29 06:39:03,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 215 [2020-10-29 06:39:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:39:03,562 INFO L225 Difference]: With dead ends: 5273 [2020-10-29 06:39:03,562 INFO L226 Difference]: Without dead ends: 2902 [2020-10-29 06:39:03,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-29 06:39:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-10-29 06:39:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2812. [2020-10-29 06:39:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2020-10-29 06:39:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 3246 transitions. [2020-10-29 06:39:03,673 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 3246 transitions. Word has length 215 [2020-10-29 06:39:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:39:03,673 INFO L481 AbstractCegarLoop]: Abstraction has 2812 states and 3246 transitions. [2020-10-29 06:39:03,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:39:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3246 transitions. [2020-10-29 06:39:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-10-29 06:39:03,679 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:39:03,680 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:39:03,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-29 06:39:03,680 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:39:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:39:03,682 INFO L82 PathProgramCache]: Analyzing trace with hash 717782474, now seen corresponding path program 1 times [2020-10-29 06:39:03,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:39:03,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [590931002] [2020-10-29 06:39:03,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:39:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:03,736 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:04,364 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:04,364 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 239 [2020-10-29 06:39:04,364 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:04,364 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 645 [2020-10-29 06:39:04,365 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:04,365 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:04,365 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-29 06:39:04,365 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-29 06:39:04,365 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-29 06:39:04,366 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:04,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:39:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:04,458 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:04,470 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:04,471 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:39:04,471 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:04,471 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 14 [2020-10-29 06:39:04,471 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:04,472 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:04,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:39:04,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:39:04,472 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-29 06:39:04,472 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:39:04,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:39:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:04,527 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:04,683 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:04,684 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-29 06:39:04,684 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:04,684 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 170 [2020-10-29 06:39:04,684 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:04,684 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:04,685 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:39:04,685 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:39:04,685 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 88 [2020-10-29 06:39:04,685 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:04,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-29 06:39:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:04,807 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:04,856 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:04,856 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-29 06:39:04,856 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:04,856 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 65 [2020-10-29 06:39:04,857 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:04,857 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:04,857 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:39:04,857 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 117 [2020-10-29 06:39:04,857 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:39:04,857 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 22 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-29 06:39:04,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [590931002] [2020-10-29 06:39:04,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:39:04,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:39:04,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684251411] [2020-10-29 06:39:04,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:39:04,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:39:04,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:39:04,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:39:04,980 INFO L87 Difference]: Start difference. First operand 2812 states and 3246 transitions. Second operand 7 states. [2020-10-29 06:39:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:39:06,394 INFO L93 Difference]: Finished difference Result 5771 states and 6661 transitions. [2020-10-29 06:39:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-29 06:39:06,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2020-10-29 06:39:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:39:06,413 INFO L225 Difference]: With dead ends: 5771 [2020-10-29 06:39:06,414 INFO L226 Difference]: Without dead ends: 2965 [2020-10-29 06:39:06,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-29 06:39:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-10-29 06:39:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2955. [2020-10-29 06:39:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2955 states. [2020-10-29 06:39:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3396 transitions. [2020-10-29 06:39:06,505 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3396 transitions. Word has length 225 [2020-10-29 06:39:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:39:06,506 INFO L481 AbstractCegarLoop]: Abstraction has 2955 states and 3396 transitions. [2020-10-29 06:39:06,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:39:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3396 transitions. [2020-10-29 06:39:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2020-10-29 06:39:06,512 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:39:06,513 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 06:39:06,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-29 06:39:06,513 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:39:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:39:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash -98834754, now seen corresponding path program 1 times [2020-10-29 06:39:06,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:39:06,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [77467167] [2020-10-29 06:39:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:39:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:06,628 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:07,059 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:07,059 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 289 [2020-10-29 06:39:07,059 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:07,059 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 470 [2020-10-29 06:39:07,059 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:07,060 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:07,060 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:39:07,060 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 268 [2020-10-29 06:39:07,060 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-10-29 06:39:07,060 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:07,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:39:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:07,196 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:07,205 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:07,205 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:39:07,205 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:07,206 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-10-29 06:39:07,206 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:07,206 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:07,206 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:39:07,206 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:39:07,206 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:39:07,207 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:07,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:39:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:07,232 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:07,271 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:07,272 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-29 06:39:07,272 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:07,272 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 41 [2020-10-29 06:39:07,272 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:07,272 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:07,272 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:39:07,273 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:39:07,273 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:39:07,273 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:07,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-29 06:39:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:07,361 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:07,461 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:07,462 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 142 [2020-10-29 06:39:07,462 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:07,462 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 120 [2020-10-29 06:39:07,462 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:07,462 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:07,462 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:39:07,462 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:39:07,462 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 136 [2020-10-29 06:39:07,463 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-10-29 06:39:07,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [77467167] [2020-10-29 06:39:07,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:39:07,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-29 06:39:07,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089297544] [2020-10-29 06:39:07,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-29 06:39:07,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:39:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-29 06:39:07,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-29 06:39:07,577 INFO L87 Difference]: Start difference. First operand 2955 states and 3396 transitions. Second operand 6 states. [2020-10-29 06:39:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:39:09,547 INFO L93 Difference]: Finished difference Result 5908 states and 6789 transitions. [2020-10-29 06:39:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-29 06:39:09,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 275 [2020-10-29 06:39:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:39:09,564 INFO L225 Difference]: With dead ends: 5908 [2020-10-29 06:39:09,565 INFO L226 Difference]: Without dead ends: 2953 [2020-10-29 06:39:09,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-29 06:39:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-10-29 06:39:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2949. [2020-10-29 06:39:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2020-10-29 06:39:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3279 transitions. [2020-10-29 06:39:09,659 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3279 transitions. Word has length 275 [2020-10-29 06:39:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:39:09,660 INFO L481 AbstractCegarLoop]: Abstraction has 2949 states and 3279 transitions. [2020-10-29 06:39:09,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-29 06:39:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3279 transitions. [2020-10-29 06:39:09,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2020-10-29 06:39:09,669 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:39:09,670 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:39:09,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-29 06:39:09,670 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:39:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:39:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1097034579, now seen corresponding path program 1 times [2020-10-29 06:39:09,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:39:09,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1129898981] [2020-10-29 06:39:09,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:39:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:09,798 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:10,315 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:10,315 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 356 [2020-10-29 06:39:10,315 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:10,315 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 568 [2020-10-29 06:39:10,315 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:10,316 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:10,316 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:39:10,316 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-29 06:39:10,316 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 90 [2020-10-29 06:39:10,316 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:10,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:39:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:10,413 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:10,419 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:10,420 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:39:10,420 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:10,420 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-29 06:39:10,420 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:10,421 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:10,421 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:39:10,421 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:39:10,421 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:39:10,421 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:10,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:39:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:10,479 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:10,557 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:10,557 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-29 06:39:10,557 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:10,557 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 92 [2020-10-29 06:39:10,558 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:10,558 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:10,558 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:39:10,558 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:39:10,558 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-29 06:39:10,559 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:10,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-29 06:39:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:10,669 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:10,790 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:10,791 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-29 06:39:10,791 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:10,791 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 133 [2020-10-29 06:39:10,791 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:10,792 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:10,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:39:10,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:39:10,792 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 88 [2020-10-29 06:39:10,792 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:10,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2020-10-29 06:39:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:39:10,920 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:39:10,970 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:39:10,970 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 120 [2020-10-29 06:39:10,970 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:39:10,970 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 65 [2020-10-29 06:39:10,970 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:39:10,971 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:39:10,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:39:10,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 117 [2020-10-29 06:39:10,971 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:39:10,971 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:39:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 121 proven. 86 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-10-29 06:39:11,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1129898981] [2020-10-29 06:39:11,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:39:11,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:39:11,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985179113] [2020-10-29 06:39:11,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:39:11,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:39:11,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:39:11,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:39:11,173 INFO L87 Difference]: Start difference. First operand 2949 states and 3279 transitions. Second operand 7 states. [2020-10-29 06:39:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:39:13,068 INFO L93 Difference]: Finished difference Result 6200 states and 6970 transitions. [2020-10-29 06:39:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-29 06:39:13,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 340 [2020-10-29 06:39:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:39:13,085 INFO L225 Difference]: With dead ends: 6200 [2020-10-29 06:39:13,085 INFO L226 Difference]: Without dead ends: 3400 [2020-10-29 06:39:13,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-29 06:39:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2020-10-29 06:39:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3398. [2020-10-29 06:39:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3398 states. [2020-10-29 06:39:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 3771 transitions. [2020-10-29 06:39:13,190 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 3771 transitions. Word has length 340 [2020-10-29 06:39:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:39:13,191 INFO L481 AbstractCegarLoop]: Abstraction has 3398 states and 3771 transitions. [2020-10-29 06:39:13,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:39:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 3771 transitions. [2020-10-29 06:39:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2020-10-29 06:39:13,203 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:39:13,203 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:39:13,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-29 06:39:13,204 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:39:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:39:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash -630089401, now seen corresponding path program 1 times [2020-10-29 06:39:13,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:39:13,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [936935252] [2020-10-29 06:39:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:39:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-29 06:39:13,352 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-29 06:39:13,352 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-29 06:39:13,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-29 06:39:13,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 06:39:13 BoogieIcfgContainer [2020-10-29 06:39:13,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-29 06:39:13,453 INFO L168 Benchmark]: Toolchain (without parser) took 51593.99 ms. Allocated memory was 170.9 MB in the beginning and 834.7 MB in the end (delta: 663.7 MB). Free memory was 144.9 MB in the beginning and 669.2 MB in the end (delta: -524.3 MB). Peak memory consumption was 140.2 MB. Max. memory is 8.0 GB. [2020-10-29 06:39:13,454 INFO L168 Benchmark]: CDTParser took 1.76 ms. Allocated memory is still 125.8 MB. Free memory is still 100.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-29 06:39:13,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1011.02 ms. Allocated memory is still 170.9 MB. Free memory was 144.3 MB in the beginning and 150.1 MB in the end (delta: -5.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 8.0 GB. [2020-10-29 06:39:13,456 INFO L168 Benchmark]: Boogie Preprocessor took 177.91 ms. Allocated memory is still 170.9 MB. Free memory was 150.1 MB in the beginning and 145.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-10-29 06:39:13,457 INFO L168 Benchmark]: RCFGBuilder took 2052.82 ms. Allocated memory is still 170.9 MB. Free memory was 145.6 MB in the beginning and 85.1 MB in the end (delta: 60.5 MB). Peak memory consumption was 62.9 MB. Max. memory is 8.0 GB. [2020-10-29 06:39:13,457 INFO L168 Benchmark]: TraceAbstraction took 48336.91 ms. Allocated memory was 170.9 MB in the beginning and 834.7 MB in the end (delta: 663.7 MB). Free memory was 84.6 MB in the beginning and 669.2 MB in the end (delta: -584.6 MB). Peak memory consumption was 79.7 MB. Max. memory is 8.0 GB. [2020-10-29 06:39:13,460 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.76 ms. Allocated memory is still 125.8 MB. Free memory is still 100.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1011.02 ms. Allocated memory is still 170.9 MB. Free memory was 144.3 MB in the beginning and 150.1 MB in the end (delta: -5.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 177.91 ms. Allocated memory is still 170.9 MB. Free memory was 150.1 MB in the beginning and 145.6 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2052.82 ms. Allocated memory is still 170.9 MB. Free memory was 145.6 MB in the beginning and 85.1 MB in the end (delta: 60.5 MB). Peak memory consumption was 62.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 48336.91 ms. Allocated memory was 170.9 MB in the beginning and 834.7 MB in the end (delta: 663.7 MB). Free memory was 84.6 MB in the beginning and 669.2 MB in the end (delta: -584.6 MB). Peak memory consumption was 79.7 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 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 FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L489] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L495] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L501] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L506] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L511] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L516] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L519] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L525] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L528] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L529] a1 = (((a1 * 5) + 278443) - -239546) [L530] return 26; [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 TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)) [L299] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819) [L300] a10 = 4 [L302] return 26; [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 TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L451] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L452] a10 = 3 [L453] a19 = 6 [L455] 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 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 TRUE (((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)) [L42] CALL reach_error() [L4] __assert_fail("0", "Problem10_label12.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: 48.1s, OverallIterations: 13, TraceHistogramMax: 4, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 360 SDtfs, 5120 SDslu, 485 SDs, 0 SdLazy, 11616 SolverSat, 1267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3398occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 1096 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.8s InterpolantComputationTime, 2559 NumberOfCodeBlocks, 2559 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1206852 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 1013/1196 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...