java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:22:17,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:22:17,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:22:17,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:22:17,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:22:17,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:22:17,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:22:17,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:22:17,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:22:17,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:22:17,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:22:17,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:22:17,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:22:17,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:22:17,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:22:17,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:22:17,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:22:17,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:22:17,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:22:17,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:22:17,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:22:17,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:22:17,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:22:17,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:22:17,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:22:17,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:22:17,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:22:17,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:22:17,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:22:17,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:22:17,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:22:17,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:22:17,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:22:17,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:22:17,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:22:17,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:22:17,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:22:17,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:22:17,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:22:17,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:22:17,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:22:17,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:22:17,531 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:22:17,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:22:17,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:22:17,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:22:17,533 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:22:17,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:22:17,534 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:22:17,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:22:17,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:22:17,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:22:17,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:22:17,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:22:17,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:22:17,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:22:17,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:22:17,536 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:22:17,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:22:17,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:22:17,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:22:17,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:22:17,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:22:17,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:22:17,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:22:17,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:22:17,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:22:17,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:22:17,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:22:17,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:22:17,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:22:17,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:22:17,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:22:17,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:22:17,589 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:22:17,590 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:22:17,590 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-09-03 19:22:17,668 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0a927c4/6aeb3b840a464fb6bf79cadb54d72890/FLAGac9acddbb [2019-09-03 19:22:18,219 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:22:18,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-09-03 19:22:18,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0a927c4/6aeb3b840a464fb6bf79cadb54d72890/FLAGac9acddbb [2019-09-03 19:22:18,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0a927c4/6aeb3b840a464fb6bf79cadb54d72890 [2019-09-03 19:22:18,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:22:18,518 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:22:18,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:22:18,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:22:18,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:22:18,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:22:18" (1/1) ... [2019-09-03 19:22:18,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779b0c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:18, skipping insertion in model container [2019-09-03 19:22:18,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:22:18" (1/1) ... [2019-09-03 19:22:18,537 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:22:18,566 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:22:18,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:22:18,850 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:22:18,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:22:19,018 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:22:19,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:19 WrapperNode [2019-09-03 19:22:19,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:22:19,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:22:19,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:22:19,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:22:19,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:19" (1/1) ... [2019-09-03 19:22:19,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:19" (1/1) ... [2019-09-03 19:22:19,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:19" (1/1) ... [2019-09-03 19:22:19,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:19" (1/1) ... [2019-09-03 19:22:19,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:19" (1/1) ... [2019-09-03 19:22:19,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:19" (1/1) ... [2019-09-03 19:22:19,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:19" (1/1) ... [2019-09-03 19:22:19,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:22:19,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:22:19,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:22:19,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:22:19,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-09-03 19:22:19,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:22:19,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:22:19,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:22:19,159 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2019-09-03 19:22:19,160 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2019-09-03 19:22:19,160 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:22:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:22:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:22:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-09-03 19:22:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-09-03 19:22:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-09-03 19:22:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-09-03 19:22:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2019-09-03 19:22:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-09-03 19:22:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-09-03 19:22:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-09-03 19:22:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-09-03 19:22:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-09-03 19:22:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-03 19:22:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2019-09-03 19:22:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2019-09-03 19:22:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2019-09-03 19:22:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2019-09-03 19:22:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2019-09-03 19:22:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2019-09-03 19:22:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2019-09-03 19:22:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2019-09-03 19:22:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2019-09-03 19:22:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2019-09-03 19:22:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2019-09-03 19:22:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2019-09-03 19:22:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2019-09-03 19:22:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2019-09-03 19:22:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2019-09-03 19:22:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:22:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:22:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:22:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:22:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:22:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:22:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:22:19,590 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:22:19,591 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 19:22:19,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:22:19 BoogieIcfgContainer [2019-09-03 19:22:19,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:22:19,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:22:19,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:22:19,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:22:19,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:22:18" (1/3) ... [2019-09-03 19:22:19,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfc7fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:22:19, skipping insertion in model container [2019-09-03 19:22:19,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:19" (2/3) ... [2019-09-03 19:22:19,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfc7fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:22:19, skipping insertion in model container [2019-09-03 19:22:19,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:22:19" (3/3) ... [2019-09-03 19:22:19,603 INFO L109 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-09-03 19:22:19,612 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:22:19,621 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:22:19,639 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:22:19,675 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:22:19,676 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:22:19,676 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:22:19,676 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:22:19,677 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:22:19,677 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:22:19,677 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:22:19,677 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:22:19,677 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:22:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-09-03 19:22:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 19:22:19,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:19,703 INFO L399 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, 1, 1, 1, 1] [2019-09-03 19:22:19,705 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2018987797, now seen corresponding path program 1 times [2019-09-03 19:22:19,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:19,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:19,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:19,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:19,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:22:19,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:22:19,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:22:19,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:22:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:22:19,887 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2019-09-03 19:22:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:19,913 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2019-09-03 19:22:19,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:22:19,914 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2019-09-03 19:22:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:19,922 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:22:19,922 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:22:19,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:22:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:22:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 19:22:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:22:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-09-03 19:22:19,968 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2019-09-03 19:22:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:19,968 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-09-03 19:22:19,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:22:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-09-03 19:22:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:22:19,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:19,970 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:19,971 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:19,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash -171780126, now seen corresponding path program 1 times [2019-09-03 19:22:19,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:19,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:19,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:20,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:22:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:22:20,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:22:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:22:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:22:20,045 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 3 states. [2019-09-03 19:22:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:20,084 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2019-09-03 19:22:20,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:22:20,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-03 19:22:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:20,088 INFO L225 Difference]: With dead ends: 78 [2019-09-03 19:22:20,088 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:22:20,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:22:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:22:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 19:22:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:22:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-09-03 19:22:20,105 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2019-09-03 19:22:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:20,106 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-09-03 19:22:20,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:22:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-09-03 19:22:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:22:20,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:20,108 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:20,108 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:20,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash 250921700, now seen corresponding path program 1 times [2019-09-03 19:22:20,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:20,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:20,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:20,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:22:20,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:22:20,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:22:20,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:22:20,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:22:20,226 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 5 states. [2019-09-03 19:22:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:20,360 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2019-09-03 19:22:20,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:22:20,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-09-03 19:22:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:20,367 INFO L225 Difference]: With dead ends: 106 [2019-09-03 19:22:20,368 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 19:22:20,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:22:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 19:22:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2019-09-03 19:22:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 19:22:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-09-03 19:22:20,404 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 33 [2019-09-03 19:22:20,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:20,404 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-09-03 19:22:20,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:22:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-09-03 19:22:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:22:20,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:20,412 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:20,412 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1210151716, now seen corresponding path program 1 times [2019-09-03 19:22:20,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:20,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:20,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:20,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:22:20,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-03 19:22:20,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:22:20,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:22:20,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:22:20,620 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 8 states. [2019-09-03 19:22:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:20,876 INFO L93 Difference]: Finished difference Result 158 states and 207 transitions. [2019-09-03 19:22:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:22:20,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-03 19:22:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:20,878 INFO L225 Difference]: With dead ends: 158 [2019-09-03 19:22:20,878 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 19:22:20,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:22:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 19:22:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2019-09-03 19:22:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 19:22:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-09-03 19:22:20,888 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 33 [2019-09-03 19:22:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:20,889 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-09-03 19:22:20,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:22:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-09-03 19:22:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:22:20,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:20,893 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:20,893 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:20,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:20,894 INFO L82 PathProgramCache]: Analyzing trace with hash -783992990, now seen corresponding path program 1 times [2019-09-03 19:22:20,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:20,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:20,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:21,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:22:21,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:22:21,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:22:21,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:22:21,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:22:21,017 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 7 states. [2019-09-03 19:22:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:21,154 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2019-09-03 19:22:21,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:22:21,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-09-03 19:22:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:21,157 INFO L225 Difference]: With dead ends: 136 [2019-09-03 19:22:21,157 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 19:22:21,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:22:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 19:22:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2019-09-03 19:22:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 19:22:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-09-03 19:22:21,165 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 33 [2019-09-03 19:22:21,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:21,165 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-09-03 19:22:21,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:22:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-09-03 19:22:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:22:21,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:21,167 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-03 19:22:21,167 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:21,168 INFO L82 PathProgramCache]: Analyzing trace with hash -731835505, now seen corresponding path program 1 times [2019-09-03 19:22:21,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:21,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:21,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:21,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:21,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:22:21,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:22:21,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-03 19:22:21,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:22:21,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:22:21,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:22:21,323 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 9 states. [2019-09-03 19:22:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:21,559 INFO L93 Difference]: Finished difference Result 162 states and 213 transitions. [2019-09-03 19:22:21,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:22:21,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-09-03 19:22:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:21,563 INFO L225 Difference]: With dead ends: 162 [2019-09-03 19:22:21,564 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 19:22:21,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:22:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 19:22:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2019-09-03 19:22:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 19:22:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2019-09-03 19:22:21,588 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 38 [2019-09-03 19:22:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:21,588 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2019-09-03 19:22:21,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:22:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2019-09-03 19:22:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:22:21,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:21,592 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-03 19:22:21,594 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:21,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1568987085, now seen corresponding path program 1 times [2019-09-03 19:22:21,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:21,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:21,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:22:21,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:22:21,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:22:21,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:22:21,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:22:21,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:22:21,702 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand 7 states. [2019-09-03 19:22:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:21,808 INFO L93 Difference]: Finished difference Result 113 states and 145 transitions. [2019-09-03 19:22:21,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:22:21,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-09-03 19:22:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:21,810 INFO L225 Difference]: With dead ends: 113 [2019-09-03 19:22:21,810 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 19:22:21,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:22:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 19:22:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2019-09-03 19:22:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-03 19:22:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2019-09-03 19:22:21,826 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 38 [2019-09-03 19:22:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:21,827 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2019-09-03 19:22:21,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:22:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2019-09-03 19:22:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:22:21,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:21,836 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-03 19:22:21,836 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:21,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1909797290, now seen corresponding path program 1 times [2019-09-03 19:22:21,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:21,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:21,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:21,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:21,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:22:21,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:22:21,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:22:21,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:22:21,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:22:21,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:22:21,909 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand 4 states. [2019-09-03 19:22:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:21,937 INFO L93 Difference]: Finished difference Result 162 states and 208 transitions. [2019-09-03 19:22:21,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:22:21,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-09-03 19:22:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:21,946 INFO L225 Difference]: With dead ends: 162 [2019-09-03 19:22:21,947 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 19:22:21,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:22:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 19:22:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-09-03 19:22:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-03 19:22:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 136 transitions. [2019-09-03 19:22:21,971 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 136 transitions. Word has length 40 [2019-09-03 19:22:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:21,971 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 136 transitions. [2019-09-03 19:22:21,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:22:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 136 transitions. [2019-09-03 19:22:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:22:21,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:21,974 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-03 19:22:21,974 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:21,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash 888728936, now seen corresponding path program 1 times [2019-09-03 19:22:21,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:21,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:21,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:21,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:21,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:22,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:22,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:22,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:22,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:22:22,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:22,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:22:22,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:22,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:22:22,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:22:22,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:22:22,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:22:22,177 INFO L87 Difference]: Start difference. First operand 108 states and 136 transitions. Second operand 8 states. [2019-09-03 19:22:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:22,328 INFO L93 Difference]: Finished difference Result 227 states and 287 transitions. [2019-09-03 19:22:22,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:22:22,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-09-03 19:22:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:22,330 INFO L225 Difference]: With dead ends: 227 [2019-09-03 19:22:22,330 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 19:22:22,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:22:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 19:22:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2019-09-03 19:22:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 19:22:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2019-09-03 19:22:22,349 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 40 [2019-09-03 19:22:22,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:22,349 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2019-09-03 19:22:22,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:22:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2019-09-03 19:22:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:22:22,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:22,351 INFO L399 BasicCegarLoop]: trace histogram [3, 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] [2019-09-03 19:22:22,351 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:22,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1526927005, now seen corresponding path program 2 times [2019-09-03 19:22:22,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:22,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:22,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:22,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:22,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:22,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:22:22,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:22,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:22:22,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:22,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:22:22,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:22,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:22,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-09-03 19:22:22,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:22:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:22:22,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:22:22,701 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 18 states. [2019-09-03 19:22:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:23,295 INFO L93 Difference]: Finished difference Result 249 states and 308 transitions. [2019-09-03 19:22:23,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:22:23,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-09-03 19:22:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:23,298 INFO L225 Difference]: With dead ends: 249 [2019-09-03 19:22:23,298 INFO L226 Difference]: Without dead ends: 194 [2019-09-03 19:22:23,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:22:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-03 19:22:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 133. [2019-09-03 19:22:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-03 19:22:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2019-09-03 19:22:23,309 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 45 [2019-09-03 19:22:23,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:23,309 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2019-09-03 19:22:23,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:22:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2019-09-03 19:22:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:22:23,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:23,314 INFO L399 BasicCegarLoop]: trace histogram [3, 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] [2019-09-03 19:22:23,314 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:23,316 INFO L82 PathProgramCache]: Analyzing trace with hash 709278555, now seen corresponding path program 1 times [2019-09-03 19:22:23,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:23,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:23,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:23,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:23,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:23,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:23,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:23,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:23,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:22:23,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:22:23,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:23,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-03 19:22:23,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:22:23,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:22:23,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:22:23,639 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand 18 states. [2019-09-03 19:22:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:24,074 INFO L93 Difference]: Finished difference Result 217 states and 268 transitions. [2019-09-03 19:22:24,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:22:24,075 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-09-03 19:22:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:24,078 INFO L225 Difference]: With dead ends: 217 [2019-09-03 19:22:24,078 INFO L226 Difference]: Without dead ends: 215 [2019-09-03 19:22:24,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:22:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-03 19:22:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 152. [2019-09-03 19:22:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 19:22:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 193 transitions. [2019-09-03 19:22:24,094 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 193 transitions. Word has length 45 [2019-09-03 19:22:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:24,095 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 193 transitions. [2019-09-03 19:22:24,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:22:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 193 transitions. [2019-09-03 19:22:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:22:24,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:24,096 INFO L399 BasicCegarLoop]: trace histogram [3, 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] [2019-09-03 19:22:24,097 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1410343133, now seen corresponding path program 1 times [2019-09-03 19:22:24,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:24,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:24,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:22:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:22:24,198 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-03 19:22:24,244 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,246 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,247 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,248 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,248 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,249 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,249 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,250 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,250 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,251 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,252 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2019-09-03 19:22:24,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:22:24 BoogieIcfgContainer [2019-09-03 19:22:24,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:22:24,269 INFO L168 Benchmark]: Toolchain (without parser) took 5750.71 ms. Allocated memory was 137.9 MB in the beginning and 267.9 MB in the end (delta: 130.0 MB). Free memory was 85.6 MB in the beginning and 110.4 MB in the end (delta: -24.8 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:22:24,270 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:22:24,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.90 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 85.2 MB in the beginning and 174.9 MB in the end (delta: -89.7 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:22:24,272 INFO L168 Benchmark]: Boogie Preprocessor took 68.36 ms. Allocated memory is still 198.7 MB. Free memory was 174.9 MB in the beginning and 172.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-09-03 19:22:24,273 INFO L168 Benchmark]: RCFGBuilder took 502.91 ms. Allocated memory is still 198.7 MB. Free memory was 172.3 MB in the beginning and 145.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-09-03 19:22:24,274 INFO L168 Benchmark]: TraceAbstraction took 4673.00 ms. Allocated memory was 198.7 MB in the beginning and 267.9 MB in the end (delta: 69.2 MB). Free memory was 145.5 MB in the beginning and 110.4 MB in the end (delta: 35.1 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:22:24,278 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 500.90 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 85.2 MB in the beginning and 174.9 MB in the end (delta: -89.7 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.36 ms. Allocated memory is still 198.7 MB. Free memory was 174.9 MB in the beginning and 172.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 502.91 ms. Allocated memory is still 198.7 MB. Free memory was 172.3 MB in the beginning and 145.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4673.00 ms. Allocated memory was 198.7 MB in the beginning and 267.9 MB in the end (delta: 69.2 MB). Free memory was 145.5 MB in the beginning and 110.4 MB in the end (delta: 35.1 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * 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: [L74] char A [2 + 2 + 4 +1]; [L75] A[2 + 2 + 4] = 0 VAL [A={-1:0}] [L76] CALL parse_expression_list (A) VAL [str={-1:0}] [L48] int start=0, i=-1, j=-1; [L49] char str2[2]; VAL [i=-1, j=-1, start=0, str={-1:0}, str={-1:0}, str2={1:0}] [L50] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={-1:0}, str={-1:0}, str2={1:0}] [L52] i++ [L53] str[i] [L54] case 0: VAL [i=0, j=-1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=2] [L69] EXPR str[i] VAL [i=0, j=-1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=2] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: VAL [i=1, j=-1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=2] [L69] EXPR str[i] VAL [i=1, j=-1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=2] [L69] COND TRUE str[i] != 0 [L52] i++ [L53] str[i] [L54] case 0: VAL [i=2, j=-1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=0] [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') [L55] EXPR str[start] [L55] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=0, str[start]=2, str[start]=2] [L55] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L56] EXPR str[start] VAL [i=2, j=-1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=0, str[start]=2] [L56] COND FALSE !(str[start] == '"') [L57] j = i-1 VAL [i=2, j=1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=0] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') [L58] EXPR str[j] [L58] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=0, str[j]=2, str[j]=2] [L58] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=0, str[j]=2, str[j]=2] [L58] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L59] (0 < j) && (str[j] == '"') [L59] EXPR str[j] [L59] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=0, str[j]=2] [L59] COND FALSE !((0 < j) && (str[j] == '"')) [L60] COND TRUE start<=j VAL [i=2, j=1, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=0] [L61] CALL r_strncpy(str2, str+start, j-start+1) VAL [\old(n)=2, dest={1:0}, src={-1:0}] [L30] return strncpy(dest,src,n); [L61] RET r_strncpy(str2, str+start, j-start+1) VAL [i=2, j=1, r_strncpy(str2, str+start, j-start+1)={35:37}, start=0, str={-1:0}, str={-1:0}, str2={1:0}, str[i]=0] [L62] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 1 error locations. UNSAFE Result, 4.5s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 565 SDtfs, 900 SDslu, 2223 SDs, 0 SdLazy, 1454 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 267 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 68987 SizeOfPredicates, 8 NumberOfNonLiveVariables, 479 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 6/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...