/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_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-0f64333 [2020-10-29 06:41:28,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-29 06:41:28,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-29 06:41:28,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-29 06:41:28,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-29 06:41:28,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-29 06:41:28,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-29 06:41:28,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-29 06:41:28,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-29 06:41:28,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-29 06:41:28,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-29 06:41:28,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-29 06:41:28,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-29 06:41:28,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-29 06:41:28,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-29 06:41:28,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-29 06:41:28,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-29 06:41:28,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-29 06:41:28,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-29 06:41:28,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-29 06:41:28,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-29 06:41:28,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-29 06:41:28,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-29 06:41:28,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-29 06:41:28,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-29 06:41:28,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-29 06:41:28,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-29 06:41:28,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-29 06:41:28,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-29 06:41:28,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-29 06:41:28,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-29 06:41:28,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-29 06:41:28,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-29 06:41:28,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-29 06:41:28,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-29 06:41:28,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-29 06:41:28,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-29 06:41:28,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-29 06:41:28,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-29 06:41:28,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-29 06:41:28,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-29 06:41:28,771 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:41:28,823 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-29 06:41:28,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-29 06:41:28,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-29 06:41:28,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-29 06:41:28,828 INFO L138 SettingsManager]: * Use SBE=true [2020-10-29 06:41:28,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-29 06:41:28,829 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-29 06:41:28,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-29 06:41:28,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-29 06:41:28,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-29 06:41:28,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-29 06:41:28,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-29 06:41:28,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-29 06:41:28,831 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-29 06:41:28,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-29 06:41:28,832 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-29 06:41:28,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-29 06:41:28,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-29 06:41:28,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-29 06:41:28,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-29 06:41:28,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-29 06:41:28,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-29 06:41:28,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-29 06:41:28,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-29 06:41:28,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-29 06:41:28,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-29 06:41:28,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-29 06:41:28,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-29 06:41:28,835 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-29 06:41:28,835 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:41:29,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-29 06:41:29,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-29 06:41:29,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-29 06:41:29,346 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-29 06:41:29,347 INFO L275 PluginConnector]: CDTParser initialized [2020-10-29 06:41:29,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-10-29 06:41:29,425 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3b8345613/8648d5d10f16427ebfb0cdbdf66594c2/FLAGf8425d111 [2020-10-29 06:41:30,148 INFO L306 CDTParser]: Found 1 translation units. [2020-10-29 06:41:30,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-10-29 06:41:30,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3b8345613/8648d5d10f16427ebfb0cdbdf66594c2/FLAGf8425d111 [2020-10-29 06:41:30,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3b8345613/8648d5d10f16427ebfb0cdbdf66594c2 [2020-10-29 06:41:30,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-29 06:41:30,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-29 06:41:30,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-29 06:41:30,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-29 06:41:30,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-29 06:41:30,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 06:41:30" (1/1) ... [2020-10-29 06:41:30,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ebef41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:30, skipping insertion in model container [2020-10-29 06:41:30,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 06:41:30" (1/1) ... [2020-10-29 06:41:30,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-29 06:41:30,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-29 06:41:30,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-29 06:41:30,907 INFO L203 MainTranslator]: Completed pre-run [2020-10-29 06:41:31,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-29 06:41:31,057 INFO L208 MainTranslator]: Completed translation [2020-10-29 06:41:31,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:31 WrapperNode [2020-10-29 06:41:31,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-29 06:41:31,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-29 06:41:31,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-29 06:41:31,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-29 06:41:31,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:31" (1/1) ... [2020-10-29 06:41:31,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:31" (1/1) ... [2020-10-29 06:41:31,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:31" (1/1) ... [2020-10-29 06:41:31,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:31" (1/1) ... [2020-10-29 06:41:31,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:31" (1/1) ... [2020-10-29 06:41:31,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:31" (1/1) ... [2020-10-29 06:41:31,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:31" (1/1) ... [2020-10-29 06:41:31,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-29 06:41:31,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-29 06:41:31,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-29 06:41:31,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-29 06:41:31,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:31" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-29 06:41:31,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-29 06:41:31,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-29 06:41:31,305 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-29 06:41:31,306 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-29 06:41:31,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-29 06:41:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-29 06:41:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-29 06:41:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-29 06:41:31,307 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-29 06:41:31,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-29 06:41:31,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-29 06:41:31,307 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-29 06:41:31,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-29 06:41:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-29 06:41:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-29 06:41:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-29 06:41:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-29 06:41:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-29 06:41:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-29 06:41:32,941 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-29 06:41:32,942 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-29 06:41:32,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 06:41:32 BoogieIcfgContainer [2020-10-29 06:41:32,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-29 06:41:32,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-29 06:41:32,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-29 06:41:32,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-29 06:41:32,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 06:41:30" (1/3) ... [2020-10-29 06:41:32,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ec8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 06:41:32, skipping insertion in model container [2020-10-29 06:41:32,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 06:41:31" (2/3) ... [2020-10-29 06:41:32,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ec8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 06:41:32, skipping insertion in model container [2020-10-29 06:41:32,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 06:41:32" (3/3) ... [2020-10-29 06:41:32,955 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-10-29 06:41:32,967 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-29 06:41:32,973 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-29 06:41:32,991 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-29 06:41:33,047 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-29 06:41:33,048 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-29 06:41:33,048 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-29 06:41:33,048 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-29 06:41:33,048 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-29 06:41:33,048 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-29 06:41:33,048 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-29 06:41:33,049 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-29 06:41:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2020-10-29 06:41:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-29 06:41:33,099 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:41:33,100 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:41:33,101 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:41:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:41:33,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1481450178, now seen corresponding path program 1 times [2020-10-29 06:41:33,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:41:33,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847218889] [2020-10-29 06:41:33,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:41:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:33,440 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:33,978 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:33,979 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 35 [2020-10-29 06:41:33,979 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:33,979 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 579 [2020-10-29 06:41:33,982 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:33,983 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:33,983 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-29 06:41:33,983 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-29 06:41:33,984 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-10-29 06:41:33,984 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-10-29 06:41:34,190 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-29 06:41:34,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:41:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:34,207 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:34,228 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:34,228 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:41:34,229 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:34,229 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 26 [2020-10-29 06:41:34,229 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:34,229 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:34,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:41:34,230 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:34,230 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-29 06:41:34,230 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:41:34,244 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:41:34,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847218889] [2020-10-29 06:41:34,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-29 06:41:34,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-29 06:41:34,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782047654] [2020-10-29 06:41:34,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-29 06:41:34,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:41:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-29 06:41:34,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-29 06:41:34,273 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 4 states. [2020-10-29 06:41:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:41:36,581 INFO L93 Difference]: Finished difference Result 586 states and 1012 transitions. [2020-10-29 06:41:36,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-29 06:41:36,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-29 06:41:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:41:36,600 INFO L225 Difference]: With dead ends: 586 [2020-10-29 06:41:36,600 INFO L226 Difference]: Without dead ends: 303 [2020-10-29 06:41:36,608 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:41:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-10-29 06:41:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2020-10-29 06:41:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-29 06:41:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 396 transitions. [2020-10-29 06:41:36,687 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 396 transitions. Word has length 25 [2020-10-29 06:41:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:41:36,688 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 396 transitions. [2020-10-29 06:41:36,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-29 06:41:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 396 transitions. [2020-10-29 06:41:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-29 06:41:36,693 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:41:36,694 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:41:36,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-29 06:41:36,694 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:41:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:41:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1963812639, now seen corresponding path program 1 times [2020-10-29 06:41:36,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:41:36,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1518606733] [2020-10-29 06:41:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:41:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:36,777 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:36,881 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:37,531 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:37,531 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 107 [2020-10-29 06:41:37,532 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-29 06:41:37,532 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 784 [2020-10-29 06:41:37,533 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:37,533 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:37,533 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-10-29 06:41:37,533 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-29 06:41:37,534 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 98 [2020-10-29 06:41:37,534 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:41:37,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:41:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:37,645 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:37,657 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:37,658 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:41:37,658 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:37,658 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 15 [2020-10-29 06:41:37,659 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:37,659 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:37,659 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:41:37,659 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:37,659 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-29 06:41:37,660 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:41:37,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:41:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:37,705 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:37,761 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:37,861 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:37,862 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-29 06:41:37,862 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-29 06:41:37,862 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 167 [2020-10-29 06:41:37,863 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:37,863 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:37,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:41:37,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:37,864 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-29 06:41:37,864 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:41:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-29 06:41:37,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1518606733] [2020-10-29 06:41:37,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:41:37,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-29 06:41:37,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009222073] [2020-10-29 06:41:37,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-29 06:41:37,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:41:37,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-29 06:41:37,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-29 06:41:37,924 INFO L87 Difference]: Start difference. First operand 299 states and 396 transitions. Second operand 5 states. [2020-10-29 06:41:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:41:39,623 INFO L93 Difference]: Finished difference Result 886 states and 1199 transitions. [2020-10-29 06:41:39,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-29 06:41:39,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-10-29 06:41:39,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:41:39,642 INFO L225 Difference]: With dead ends: 886 [2020-10-29 06:41:39,642 INFO L226 Difference]: Without dead ends: 593 [2020-10-29 06:41:39,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:41:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-10-29 06:41:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 589. [2020-10-29 06:41:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-10-29 06:41:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 757 transitions. [2020-10-29 06:41:39,694 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 757 transitions. Word has length 95 [2020-10-29 06:41:39,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:41:39,695 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 757 transitions. [2020-10-29 06:41:39,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-29 06:41:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 757 transitions. [2020-10-29 06:41:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-10-29 06:41:39,698 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:41:39,698 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-29 06:41:39,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-29 06:41:39,699 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:41:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:41:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1711452285, now seen corresponding path program 1 times [2020-10-29 06:41:39,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:41:39,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1627604457] [2020-10-29 06:41:39,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:41:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:39,766 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:40,004 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:40,004 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-29 06:41:40,005 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:40,005 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 256 [2020-10-29 06:41:40,005 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:40,005 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:40,005 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:41:40,006 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-29 06:41:40,006 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-10-29 06:41:40,006 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:40,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:41:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:40,106 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:40,112 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:40,113 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:41:40,113 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:40,113 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-29 06:41:40,113 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:40,114 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:40,114 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:41:40,114 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:40,114 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:41:40,114 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:40,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:41:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:40,189 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:40,251 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:40,252 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-29 06:41:40,252 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:40,252 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 98 [2020-10-29 06:41:40,252 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:40,252 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:40,253 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:41:40,253 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:40,253 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-29 06:41:40,253 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-29 06:41:40,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1627604457] [2020-10-29 06:41:40,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:41:40,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-29 06:41:40,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562055102] [2020-10-29 06:41:40,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-29 06:41:40,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:41:40,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-29 06:41:40,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-29 06:41:40,302 INFO L87 Difference]: Start difference. First operand 589 states and 757 transitions. Second operand 5 states. [2020-10-29 06:41:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:41:42,024 INFO L93 Difference]: Finished difference Result 1466 states and 1965 transitions. [2020-10-29 06:41:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-29 06:41:42,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2020-10-29 06:41:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:41:42,040 INFO L225 Difference]: With dead ends: 1466 [2020-10-29 06:41:42,041 INFO L226 Difference]: Without dead ends: 883 [2020-10-29 06:41:42,043 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:41:42,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2020-10-29 06:41:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 879. [2020-10-29 06:41:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-10-29 06:41:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1133 transitions. [2020-10-29 06:41:42,140 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1133 transitions. Word has length 104 [2020-10-29 06:41:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:41:42,141 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 1133 transitions. [2020-10-29 06:41:42,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-29 06:41:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1133 transitions. [2020-10-29 06:41:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-29 06:41:42,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:41:42,148 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:41:42,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-29 06:41:42,148 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:41:42,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:41:42,149 INFO L82 PathProgramCache]: Analyzing trace with hash 528916950, now seen corresponding path program 1 times [2020-10-29 06:41:42,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:41:42,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786737848] [2020-10-29 06:41:42,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:41:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:42,236 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:42,389 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:42,643 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:42,884 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:43,861 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:43,862 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 191 [2020-10-29 06:41:43,862 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-29 06:41:43,862 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1659 [2020-10-29 06:41:43,862 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:43,862 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:43,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:41:43,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-29 06:41:43,863 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-10-29 06:41:43,863 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:41:43,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:41:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:43,990 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:43,996 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:43,996 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:41:43,996 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:43,996 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-29 06:41:43,997 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:43,997 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:43,997 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:41:43,997 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:43,997 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:41:43,998 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:44,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:41:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:44,047 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:44,107 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:44,108 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-29 06:41:44,108 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:44,108 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 73 [2020-10-29 06:41:44,108 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:44,108 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:44,109 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:41:44,109 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:44,109 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-29 06:41:44,109 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:44,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-29 06:41:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:44,160 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:44,265 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:44,265 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-29 06:41:44,266 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:44,266 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 115 [2020-10-29 06:41:44,266 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:44,266 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:44,266 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:41:44,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:41:44,267 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-29 06:41:44,267 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:41:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 104 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:41:44,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786737848] [2020-10-29 06:41:44,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:41:44,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:41:44,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320926865] [2020-10-29 06:41:44,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:41:44,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:41:44,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:41:44,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:41:44,371 INFO L87 Difference]: Start difference. First operand 879 states and 1133 transitions. Second operand 7 states. [2020-10-29 06:41:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:41:46,851 INFO L93 Difference]: Finished difference Result 2299 states and 3258 transitions. [2020-10-29 06:41:46,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-29 06:41:46,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 177 [2020-10-29 06:41:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:41:46,874 INFO L225 Difference]: With dead ends: 2299 [2020-10-29 06:41:46,875 INFO L226 Difference]: Without dead ends: 1120 [2020-10-29 06:41:46,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-29 06:41:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2020-10-29 06:41:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1040. [2020-10-29 06:41:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2020-10-29 06:41:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1288 transitions. [2020-10-29 06:41:46,977 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1288 transitions. Word has length 177 [2020-10-29 06:41:46,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:41:46,979 INFO L481 AbstractCegarLoop]: Abstraction has 1040 states and 1288 transitions. [2020-10-29 06:41:46,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:41:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1288 transitions. [2020-10-29 06:41:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-29 06:41:46,988 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:41:46,988 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:41:46,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-29 06:41:46,988 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:41:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:41:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1576973084, now seen corresponding path program 1 times [2020-10-29 06:41:46,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:41:46,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [470593309] [2020-10-29 06:41:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:41:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:47,070 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:47,279 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:47,567 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:47,990 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:48,331 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:48,332 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 199 [2020-10-29 06:41:48,332 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-29 06:41:48,332 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1288 [2020-10-29 06:41:48,333 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:48,333 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:48,333 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:41:48,333 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-29 06:41:48,333 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-29 06:41:48,333 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:48,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:41:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:48,423 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:48,430 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:48,430 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:41:48,430 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:48,431 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 8 [2020-10-29 06:41:48,431 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:48,431 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:48,431 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:41:48,431 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:48,431 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:41:48,432 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:48,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:41:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:48,468 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:48,510 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:48,511 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-29 06:41:48,511 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:48,511 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 51 [2020-10-29 06:41:48,511 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:48,512 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:48,512 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:41:48,512 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:48,512 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-29 06:41:48,512 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:48,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-29 06:41:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:48,559 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:48,661 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:48,662 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-29 06:41:48,662 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:48,662 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 113 [2020-10-29 06:41:48,662 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:48,663 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:48,663 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:41:48,663 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:41:48,663 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-29 06:41:48,663 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:41:48,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [470593309] [2020-10-29 06:41:48,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:41:48,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:41:48,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039622456] [2020-10-29 06:41:48,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:41:48,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:41:48,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:41:48,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:41:48,809 INFO L87 Difference]: Start difference. First operand 1040 states and 1288 transitions. Second operand 7 states. [2020-10-29 06:41:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:41:50,842 INFO L93 Difference]: Finished difference Result 2545 states and 3243 transitions. [2020-10-29 06:41:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-29 06:41:50,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2020-10-29 06:41:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:41:50,854 INFO L225 Difference]: With dead ends: 2545 [2020-10-29 06:41:50,854 INFO L226 Difference]: Without dead ends: 1362 [2020-10-29 06:41:50,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 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:41:50,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-10-29 06:41:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1346. [2020-10-29 06:41:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2020-10-29 06:41:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1704 transitions. [2020-10-29 06:41:50,920 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1704 transitions. Word has length 185 [2020-10-29 06:41:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:41:50,920 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1704 transitions. [2020-10-29 06:41:50,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:41:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1704 transitions. [2020-10-29 06:41:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-10-29 06:41:50,924 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:41:50,924 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:41:50,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-29 06:41:50,925 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:41:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:41:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2114815486, now seen corresponding path program 1 times [2020-10-29 06:41:50,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:41:50,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127124409] [2020-10-29 06:41:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:41:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:50,981 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:51,075 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:51,914 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:52,148 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:52,607 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:55,631 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:55,631 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 206 [2020-10-29 06:41:55,632 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-10-29 06:41:55,632 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4668 [2020-10-29 06:41:55,632 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:55,632 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:55,632 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:41:55,632 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-29 06:41:55,633 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-29 06:41:55,633 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:55,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:41:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:55,782 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:55,787 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:55,787 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:41:55,787 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:55,787 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-10-29 06:41:55,788 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:55,788 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:55,788 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:41:55,788 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:55,788 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:41:55,788 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:55,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:41:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:55,826 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:55,877 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:55,878 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-29 06:41:55,878 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:55,878 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 60 [2020-10-29 06:41:55,878 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:55,878 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:55,879 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:41:55,879 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:41:55,879 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-29 06:41:55,879 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:55,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-29 06:41:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:55,934 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:56,040 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:41:56,040 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-29 06:41:56,041 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:41:56,041 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 119 [2020-10-29 06:41:56,041 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:41:56,041 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:41:56,041 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:41:56,042 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:41:56,042 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-29 06:41:56,042 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:41:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:41:56,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127124409] [2020-10-29 06:41:56,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:41:56,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:41:56,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949698467] [2020-10-29 06:41:56,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:41:56,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:41:56,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:41:56,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:41:56,157 INFO L87 Difference]: Start difference. First operand 1346 states and 1704 transitions. Second operand 7 states. [2020-10-29 06:41:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:41:58,151 INFO L93 Difference]: Finished difference Result 2996 states and 3899 transitions. [2020-10-29 06:41:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-29 06:41:58,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2020-10-29 06:41:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:41:58,167 INFO L225 Difference]: With dead ends: 2996 [2020-10-29 06:41:58,168 INFO L226 Difference]: Without dead ends: 1656 [2020-10-29 06:41:58,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 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:41:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2020-10-29 06:41:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1644. [2020-10-29 06:41:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1644 states. [2020-10-29 06:41:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2146 transitions. [2020-10-29 06:41:58,246 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2146 transitions. Word has length 192 [2020-10-29 06:41:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:41:58,247 INFO L481 AbstractCegarLoop]: Abstraction has 1644 states and 2146 transitions. [2020-10-29 06:41:58,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:41:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2146 transitions. [2020-10-29 06:41:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-10-29 06:41:58,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:41:58,252 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:41:58,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-29 06:41:58,253 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:41:58,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:41:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 565012434, now seen corresponding path program 1 times [2020-10-29 06:41:58,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:41:58,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1401386463] [2020-10-29 06:41:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:41:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:41:58,355 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:58,460 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:41:59,440 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:00,002 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:01,327 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:42:01,327 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 216 [2020-10-29 06:42:01,328 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-10-29 06:42:01,328 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3016 [2020-10-29 06:42:01,328 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:42:01,328 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:42:01,328 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:42:01,328 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 97 [2020-10-29 06:42:01,328 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-29 06:42:01,329 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:42:01,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:42:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:42:01,422 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:01,425 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:42:01,426 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:42:01,426 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:42:01,426 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-29 06:42:01,426 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:42:01,426 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:42:01,426 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:42:01,427 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:42:01,428 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:42:01,429 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-29 06:42:01,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:42:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:42:01,471 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:01,533 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:42:01,534 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 88 [2020-10-29 06:42:01,534 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:42:01,534 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 72 [2020-10-29 06:42:01,534 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:42:01,534 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:42:01,534 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:42:01,535 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:42:01,535 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-10-29 06:42:01,535 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:42:01,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-29 06:42:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:42:01,588 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:01,684 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:42:01,685 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-29 06:42:01,685 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:42:01,685 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 106 [2020-10-29 06:42:01,685 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:42:01,685 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:42:01,685 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:42:01,686 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:42:01,686 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-29 06:42:01,686 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:42:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:42:01,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1401386463] [2020-10-29 06:42:01,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:42:01,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:42:01,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262063833] [2020-10-29 06:42:01,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:42:01,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:42:01,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:42:01,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:42:01,803 INFO L87 Difference]: Start difference. First operand 1644 states and 2146 transitions. Second operand 7 states. [2020-10-29 06:42:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:42:06,263 INFO L93 Difference]: Finished difference Result 4177 states and 5539 transitions. [2020-10-29 06:42:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-29 06:42:06,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2020-10-29 06:42:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:42:06,280 INFO L225 Difference]: With dead ends: 4177 [2020-10-29 06:42:06,280 INFO L226 Difference]: Without dead ends: 2539 [2020-10-29 06:42:06,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 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:42:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2020-10-29 06:42:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2375. [2020-10-29 06:42:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2020-10-29 06:42:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 2953 transitions. [2020-10-29 06:42:06,378 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 2953 transitions. Word has length 202 [2020-10-29 06:42:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:42:06,378 INFO L481 AbstractCegarLoop]: Abstraction has 2375 states and 2953 transitions. [2020-10-29 06:42:06,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:42:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2953 transitions. [2020-10-29 06:42:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-10-29 06:42:06,385 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:42:06,385 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:42:06,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-29 06:42:06,385 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:42:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:42:06,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1270711256, now seen corresponding path program 1 times [2020-10-29 06:42:06,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:42:06,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2106508024] [2020-10-29 06:42:06,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:42:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:42:06,442 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:06,504 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:07,416 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:07,654 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:08,243 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:10,394 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:42:10,394 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 225 [2020-10-29 06:42:10,394 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 5 [2020-10-29 06:42:10,394 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3969 [2020-10-29 06:42:10,395 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:42:10,395 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:42:10,395 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:42:10,395 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 106 [2020-10-29 06:42:10,395 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-10-29 06:42:10,395 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-29 06:42:10,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-29 06:42:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:42:10,516 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:10,525 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:42:10,525 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-29 06:42:10,525 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:42:10,526 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 11 [2020-10-29 06:42:10,526 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:42:10,526 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:42:10,526 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-29 06:42:10,526 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:42:10,527 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-29 06:42:10,527 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:42:10,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-29 06:42:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:42:10,580 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:10,648 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:42:10,649 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 97 [2020-10-29 06:42:10,649 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:42:10,649 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 85 [2020-10-29 06:42:10,649 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:42:10,652 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:42:10,652 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-29 06:42:10,652 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-29 06:42:10,652 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-29 06:42:10,653 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-29 06:42:10,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-29 06:42:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-29 06:42:10,721 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-29 06:42:10,827 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-29 06:42:10,828 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 91 [2020-10-29 06:42:10,828 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-29 06:42:10,828 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 118 [2020-10-29 06:42:10,828 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLESTAMONGWIDE [2020-10-29 06:42:10,829 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.3 [2020-10-29 06:42:10,829 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-29 06:42:10,830 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-29 06:42:10,830 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-10-29 06:42:10,830 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-29 06:42:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 121 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-29 06:42:10,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2106508024] [2020-10-29 06:42:10,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-29 06:42:10,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-29 06:42:10,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528853116] [2020-10-29 06:42:10,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-29 06:42:10,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-29 06:42:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-29 06:42:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-29 06:42:10,987 INFO L87 Difference]: Start difference. First operand 2375 states and 2953 transitions. Second operand 7 states. [2020-10-29 06:42:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-29 06:42:13,474 INFO L93 Difference]: Finished difference Result 5912 states and 7500 transitions. [2020-10-29 06:42:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-29 06:42:13,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 211 [2020-10-29 06:42:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-29 06:42:13,496 INFO L225 Difference]: With dead ends: 5912 [2020-10-29 06:42:13,497 INFO L226 Difference]: Without dead ends: 3543 [2020-10-29 06:42:13,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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:42:13,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2020-10-29 06:42:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3249. [2020-10-29 06:42:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3249 states. [2020-10-29 06:42:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 4108 transitions. [2020-10-29 06:42:13,620 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 4108 transitions. Word has length 211 [2020-10-29 06:42:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-29 06:42:13,620 INFO L481 AbstractCegarLoop]: Abstraction has 3249 states and 4108 transitions. [2020-10-29 06:42:13,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-29 06:42:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 4108 transitions. [2020-10-29 06:42:13,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-10-29 06:42:13,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-29 06:42:13,631 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:42:13,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-29 06:42:13,632 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-29 06:42:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-29 06:42:13,633 INFO L82 PathProgramCache]: Analyzing trace with hash -291438442, now seen corresponding path program 1 times [2020-10-29 06:42:13,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-29 06:42:13,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947970358] [2020-10-29 06:42:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-29 06:42:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-29 06:42:13,746 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-29 06:42:13,746 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-29 06:42:13,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-29 06:42:13,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 06:42:13 BoogieIcfgContainer [2020-10-29 06:42:13,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-29 06:42:13,815 INFO L168 Benchmark]: Toolchain (without parser) took 43407.54 ms. Allocated memory was 168.8 MB in the beginning and 755.0 MB in the end (delta: 586.2 MB). Free memory was 142.6 MB in the beginning and 429.3 MB in the end (delta: -286.7 MB). Peak memory consumption was 301.0 MB. Max. memory is 8.0 GB. [2020-10-29 06:42:13,815 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 168.8 MB. Free memory is still 150.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-29 06:42:13,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.96 ms. Allocated memory is still 168.8 MB. Free memory was 142.0 MB in the beginning and 115.3 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2020-10-29 06:42:13,817 INFO L168 Benchmark]: Boogie Preprocessor took 159.04 ms. Allocated memory is still 168.8 MB. Free memory was 115.3 MB in the beginning and 110.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-10-29 06:42:13,818 INFO L168 Benchmark]: RCFGBuilder took 1726.39 ms. Allocated memory is still 168.8 MB. Free memory was 110.7 MB in the beginning and 85.5 MB in the end (delta: 25.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 8.0 GB. [2020-10-29 06:42:13,819 INFO L168 Benchmark]: TraceAbstraction took 40865.42 ms. Allocated memory was 168.8 MB in the beginning and 755.0 MB in the end (delta: 586.2 MB). Free memory was 84.9 MB in the beginning and 429.3 MB in the end (delta: -344.4 MB). Peak memory consumption was 242.3 MB. Max. memory is 8.0 GB. [2020-10-29 06:42:13,822 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 168.8 MB. Free memory is still 150.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 644.96 ms. Allocated memory is still 168.8 MB. Free memory was 142.0 MB in the beginning and 115.3 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 159.04 ms. Allocated memory is still 168.8 MB. Free memory was 115.3 MB in the beginning and 110.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1726.39 ms. Allocated memory is still 168.8 MB. Free memory was 110.7 MB in the beginning and 85.5 MB in the end (delta: 25.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 40865.42 ms. Allocated memory was 168.8 MB in the beginning and 755.0 MB in the end (delta: 586.2 MB). Free memory was 84.9 MB in the beginning and 429.3 MB in the end (delta: -344.4 MB). Peak memory consumption was 242.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputC = 3; [L10] int inputD = 4; [L11] int inputE = 5; [L12] int inputF = 6; [L13] int inputB = 2; [L16] int a1 = 23; [L17] int a19 = 9; [L18] int a10 = 0; [L19] int a12 = 0; [L20] int a4 = 14; [L581] int output = -1; [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L293] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L298] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L303] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L308] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L314] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L319] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L322] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L325] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L328] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L331] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L337] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L342] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L347] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L353] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L356] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L359] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L362] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L367] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L372] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L377] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L380] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L385] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L390] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L395] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L400] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L405] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L410] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L416] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L421] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L427] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L428] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L429] a10 = 1 [L431] return 25; [L592] RET, EXPR calculate_output(input) [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L592] CALL, EXPR calculate_output(input) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L256] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L262] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L267] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L273] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L279] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L285] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L288] COND 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 FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L531] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L536] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L542] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L547] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L550] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L556] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L559] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L560] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L561] a10 = 4 [L562] a19 = 8 [L564] 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 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 TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L60] CALL reach_error() [L4] __assert_fail("0", "Problem10_label55.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: 40.7s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 214 SDtfs, 3477 SDslu, 250 SDs, 0 SdLazy, 6525 SolverSat, 1076 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3249occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 578 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 1472 NumberOfCodeBlocks, 1472 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1183 ConstructedInterpolants, 0 QuantifiedInterpolants, 477620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 589/601 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...