/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/forester-heap/dll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 03:53:44,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 03:53:44,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 03:53:44,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 03:53:44,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 03:53:44,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 03:53:44,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 03:53:44,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 03:53:44,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 03:53:44,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 03:53:44,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 03:53:44,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 03:53:44,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 03:53:44,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 03:53:44,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 03:53:44,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 03:53:44,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 03:53:44,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 03:53:44,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 03:53:44,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 03:53:44,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 03:53:44,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 03:53:44,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 03:53:44,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 03:53:44,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 03:53:44,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 03:53:44,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 03:53:44,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 03:53:44,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 03:53:44,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 03:53:44,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 03:53:44,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 03:53:44,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 03:53:44,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 03:53:44,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 03:53:44,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 03:53:44,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 03:53:44,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 03:53:44,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 03:53:44,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 03:53:44,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 03:53:44,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 03:53:44,677 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 03:53:44,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 03:53:44,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 03:53:44,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 03:53:44,683 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 03:53:44,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 03:53:44,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 03:53:44,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 03:53:44,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 03:53:44,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 03:53:44,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 03:53:44,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 03:53:44,686 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 03:53:44,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 03:53:44,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 03:53:44,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 03:53:44,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 03:53:44,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 03:53:44,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 03:53:44,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 03:53:44,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 03:53:44,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 03:53:44,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 03:53:44,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 03:53:44,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 03:53:44,689 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/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 [2020-12-22 03:53:45,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 03:53:45,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 03:53:45,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 03:53:45,147 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 03:53:45,148 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 03:53:45,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2020-12-22 03:53:45,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c41af38cc/2d0546ad0b6c4cdbb22752263099b552/FLAGc8b2547e7 [2020-12-22 03:53:46,060 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 03:53:46,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2020-12-22 03:53:46,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c41af38cc/2d0546ad0b6c4cdbb22752263099b552/FLAGc8b2547e7 [2020-12-22 03:53:46,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c41af38cc/2d0546ad0b6c4cdbb22752263099b552 [2020-12-22 03:53:46,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 03:53:46,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 03:53:46,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 03:53:46,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 03:53:46,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 03:53:46,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 03:53:46" (1/1) ... [2020-12-22 03:53:46,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283a542d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:46, skipping insertion in model container [2020-12-22 03:53:46,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 03:53:46" (1/1) ... [2020-12-22 03:53:46,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 03:53:46,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 03:53:46,831 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2020-12-22 03:53:46,853 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2020-12-22 03:53:46,861 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2020-12-22 03:53:46,863 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2020-12-22 03:53:46,871 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2020-12-22 03:53:46,874 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2020-12-22 03:53:46,882 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2020-12-22 03:53:46,885 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2020-12-22 03:53:46,888 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2020-12-22 03:53:46,894 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2020-12-22 03:53:46,903 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2020-12-22 03:53:46,907 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2020-12-22 03:53:46,908 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2020-12-22 03:53:46,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 03:53:46,937 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 03:53:47,013 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2020-12-22 03:53:47,019 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2020-12-22 03:53:47,022 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2020-12-22 03:53:47,026 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2020-12-22 03:53:47,037 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2020-12-22 03:53:47,039 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2020-12-22 03:53:47,042 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2020-12-22 03:53:47,045 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2020-12-22 03:53:47,046 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2020-12-22 03:53:47,056 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2020-12-22 03:53:47,060 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2020-12-22 03:53:47,061 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2020-12-22 03:53:47,062 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2020-12-22 03:53:47,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 03:53:47,153 INFO L208 MainTranslator]: Completed translation [2020-12-22 03:53:47,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47 WrapperNode [2020-12-22 03:53:47,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 03:53:47,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 03:53:47,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 03:53:47,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 03:53:47,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (1/1) ... [2020-12-22 03:53:47,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (1/1) ... [2020-12-22 03:53:47,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 03:53:47,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 03:53:47,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 03:53:47,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 03:53:47,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (1/1) ... [2020-12-22 03:53:47,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (1/1) ... [2020-12-22 03:53:47,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (1/1) ... [2020-12-22 03:53:47,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (1/1) ... [2020-12-22 03:53:47,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (1/1) ... [2020-12-22 03:53:47,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (1/1) ... [2020-12-22 03:53:47,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (1/1) ... [2020-12-22 03:53:47,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 03:53:47,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 03:53:47,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 03:53:47,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 03:53:47,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (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 [2020-12-22 03:53:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-22 03:53:47,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-22 03:53:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 03:53:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-22 03:53:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 03:53:47,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 03:53:47,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 03:53:47,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 03:53:48,208 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 03:53:48,209 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2020-12-22 03:53:48,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:53:48 BoogieIcfgContainer [2020-12-22 03:53:48,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 03:53:48,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 03:53:48,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 03:53:48,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 03:53:48,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 03:53:46" (1/3) ... [2020-12-22 03:53:48,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37484529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 03:53:48, skipping insertion in model container [2020-12-22 03:53:48,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 03:53:47" (2/3) ... [2020-12-22 03:53:48,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37484529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 03:53:48, skipping insertion in model container [2020-12-22 03:53:48,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:53:48" (3/3) ... [2020-12-22 03:53:48,222 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2020-12-22 03:53:48,230 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 03:53:48,236 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-12-22 03:53:48,258 INFO L253 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-12-22 03:53:48,288 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 03:53:48,288 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 03:53:48,289 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 03:53:48,289 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 03:53:48,289 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 03:53:48,289 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 03:53:48,289 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 03:53:48,289 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 03:53:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2020-12-22 03:53:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-22 03:53:48,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:48,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-22 03:53:48,317 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:48,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2020-12-22 03:53:48,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:48,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830064159] [2020-12-22 03:53:48,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:48,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830064159] [2020-12-22 03:53:48,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:48,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:53:48,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910395396] [2020-12-22 03:53:48,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:53:48,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:48,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:53:48,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:53:48,591 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2020-12-22 03:53:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:48,683 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2020-12-22 03:53:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:53:48,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-22 03:53:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:48,720 INFO L225 Difference]: With dead ends: 180 [2020-12-22 03:53:48,721 INFO L226 Difference]: Without dead ends: 95 [2020-12-22 03:53:48,728 INFO L677 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 [2020-12-22 03:53:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-22 03:53:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2020-12-22 03:53:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-22 03:53:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2020-12-22 03:53:48,804 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2020-12-22 03:53:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:48,805 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2020-12-22 03:53:48,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:53:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2020-12-22 03:53:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-22 03:53:48,806 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:48,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:48,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 03:53:48,808 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2020-12-22 03:53:48,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:48,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548035941] [2020-12-22 03:53:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:48,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548035941] [2020-12-22 03:53:48,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:48,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:53:48,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912809663] [2020-12-22 03:53:48,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:53:48,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:48,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:53:48,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:53:48,907 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 3 states. [2020-12-22 03:53:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:48,928 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2020-12-22 03:53:48,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:53:48,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-12-22 03:53:48,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:48,931 INFO L225 Difference]: With dead ends: 80 [2020-12-22 03:53:48,931 INFO L226 Difference]: Without dead ends: 78 [2020-12-22 03:53:48,932 INFO L677 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 [2020-12-22 03:53:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-22 03:53:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-12-22 03:53:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-22 03:53:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2020-12-22 03:53:48,943 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2020-12-22 03:53:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:48,943 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2020-12-22 03:53:48,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:53:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2020-12-22 03:53:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-22 03:53:48,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:48,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:48,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 03:53:48,945 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2020-12-22 03:53:48,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:48,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777483252] [2020-12-22 03:53:48,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:49,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777483252] [2020-12-22 03:53:49,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:49,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 03:53:49,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919975780] [2020-12-22 03:53:49,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 03:53:49,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:49,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 03:53:49,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 03:53:49,070 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 4 states. [2020-12-22 03:53:49,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:49,192 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2020-12-22 03:53:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 03:53:49,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-22 03:53:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:49,194 INFO L225 Difference]: With dead ends: 79 [2020-12-22 03:53:49,194 INFO L226 Difference]: Without dead ends: 77 [2020-12-22 03:53:49,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 03:53:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-12-22 03:53:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-12-22 03:53:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-22 03:53:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2020-12-22 03:53:49,204 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2020-12-22 03:53:49,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:49,204 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2020-12-22 03:53:49,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 03:53:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-12-22 03:53:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 03:53:49,205 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:49,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:49,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 03:53:49,206 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:49,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2020-12-22 03:53:49,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:49,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099106295] [2020-12-22 03:53:49,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:49,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099106295] [2020-12-22 03:53:49,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:49,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 03:53:49,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493349245] [2020-12-22 03:53:49,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 03:53:49,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:49,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 03:53:49,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 03:53:49,292 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 4 states. [2020-12-22 03:53:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:49,445 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2020-12-22 03:53:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 03:53:49,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-22 03:53:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:49,447 INFO L225 Difference]: With dead ends: 195 [2020-12-22 03:53:49,448 INFO L226 Difference]: Without dead ends: 128 [2020-12-22 03:53:49,449 INFO L677 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 [2020-12-22 03:53:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-12-22 03:53:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2020-12-22 03:53:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-22 03:53:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2020-12-22 03:53:49,458 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2020-12-22 03:53:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:49,459 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2020-12-22 03:53:49,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 03:53:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2020-12-22 03:53:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 03:53:49,460 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:49,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:49,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 03:53:49,460 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:49,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2020-12-22 03:53:49,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:49,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634174672] [2020-12-22 03:53:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:49,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634174672] [2020-12-22 03:53:49,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:49,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 03:53:49,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652164909] [2020-12-22 03:53:49,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 03:53:49,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:49,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 03:53:49,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:53:49,551 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2020-12-22 03:53:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:49,720 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2020-12-22 03:53:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 03:53:49,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-22 03:53:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:49,723 INFO L225 Difference]: With dead ends: 122 [2020-12-22 03:53:49,723 INFO L226 Difference]: Without dead ends: 118 [2020-12-22 03:53:49,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 03:53:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-22 03:53:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2020-12-22 03:53:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-22 03:53:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2020-12-22 03:53:49,733 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2020-12-22 03:53:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:49,733 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2020-12-22 03:53:49,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 03:53:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2020-12-22 03:53:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 03:53:49,735 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:49,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:49,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 03:53:49,735 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:49,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2020-12-22 03:53:49,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:49,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778501313] [2020-12-22 03:53:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:49,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778501313] [2020-12-22 03:53:49,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:49,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 03:53:49,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123574838] [2020-12-22 03:53:49,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 03:53:49,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:49,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 03:53:49,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 03:53:49,788 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2020-12-22 03:53:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:49,907 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2020-12-22 03:53:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 03:53:49,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-22 03:53:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:49,910 INFO L225 Difference]: With dead ends: 132 [2020-12-22 03:53:49,910 INFO L226 Difference]: Without dead ends: 112 [2020-12-22 03:53:49,911 INFO L677 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 [2020-12-22 03:53:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-22 03:53:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2020-12-22 03:53:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-22 03:53:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2020-12-22 03:53:49,933 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2020-12-22 03:53:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:49,933 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2020-12-22 03:53:49,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 03:53:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2020-12-22 03:53:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 03:53:49,935 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:49,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 03:53:49,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 03:53:49,939 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:49,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:49,939 INFO L82 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2020-12-22 03:53:49,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:49,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17481868] [2020-12-22 03:53:49,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:50,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17481868] [2020-12-22 03:53:50,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:50,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:53:50,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747347632] [2020-12-22 03:53:50,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:53:50,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:53:50,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:53:50,042 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2020-12-22 03:53:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:50,067 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2020-12-22 03:53:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:53:50,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-12-22 03:53:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:50,071 INFO L225 Difference]: With dead ends: 137 [2020-12-22 03:53:50,071 INFO L226 Difference]: Without dead ends: 96 [2020-12-22 03:53:50,075 INFO L677 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 [2020-12-22 03:53:50,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-12-22 03:53:50,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2020-12-22 03:53:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-22 03:53:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2020-12-22 03:53:50,096 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2020-12-22 03:53:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:50,096 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2020-12-22 03:53:50,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:53:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2020-12-22 03:53:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 03:53:50,097 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:50,097 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] [2020-12-22 03:53:50,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 03:53:50,098 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:50,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:50,101 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2020-12-22 03:53:50,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:50,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029079935] [2020-12-22 03:53:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:50,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029079935] [2020-12-22 03:53:50,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:50,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:53:50,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044970201] [2020-12-22 03:53:50,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:53:50,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:50,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:53:50,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:53:50,194 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2020-12-22 03:53:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:50,211 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2020-12-22 03:53:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:53:50,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-22 03:53:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:50,213 INFO L225 Difference]: With dead ends: 75 [2020-12-22 03:53:50,213 INFO L226 Difference]: Without dead ends: 73 [2020-12-22 03:53:50,214 INFO L677 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 [2020-12-22 03:53:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-12-22 03:53:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-12-22 03:53:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-22 03:53:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2020-12-22 03:53:50,222 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2020-12-22 03:53:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:50,222 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2020-12-22 03:53:50,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:53:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2020-12-22 03:53:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 03:53:50,223 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:50,224 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] [2020-12-22 03:53:50,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 03:53:50,224 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2020-12-22 03:53:50,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:50,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462583430] [2020-12-22 03:53:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:50,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462583430] [2020-12-22 03:53:50,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:50,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 03:53:50,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470002876] [2020-12-22 03:53:50,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 03:53:50,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:50,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 03:53:50,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 03:53:50,322 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2020-12-22 03:53:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:50,432 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2020-12-22 03:53:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 03:53:50,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-12-22 03:53:50,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:50,433 INFO L225 Difference]: With dead ends: 74 [2020-12-22 03:53:50,434 INFO L226 Difference]: Without dead ends: 72 [2020-12-22 03:53:50,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 03:53:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-12-22 03:53:50,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-12-22 03:53:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-22 03:53:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2020-12-22 03:53:50,442 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2020-12-22 03:53:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:50,442 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2020-12-22 03:53:50,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 03:53:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2020-12-22 03:53:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 03:53:50,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:50,444 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] [2020-12-22 03:53:50,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 03:53:50,445 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:50,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:50,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2020-12-22 03:53:50,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:50,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234833843] [2020-12-22 03:53:50,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:50,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234833843] [2020-12-22 03:53:50,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:50,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 03:53:50,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350413322] [2020-12-22 03:53:50,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 03:53:50,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 03:53:50,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-22 03:53:50,564 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 7 states. [2020-12-22 03:53:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:50,880 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2020-12-22 03:53:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 03:53:50,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-22 03:53:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:50,882 INFO L225 Difference]: With dead ends: 199 [2020-12-22 03:53:50,883 INFO L226 Difference]: Without dead ends: 157 [2020-12-22 03:53:50,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-22 03:53:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-22 03:53:50,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 93. [2020-12-22 03:53:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-12-22 03:53:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2020-12-22 03:53:50,898 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 24 [2020-12-22 03:53:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:50,899 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2020-12-22 03:53:50,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 03:53:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2020-12-22 03:53:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 03:53:50,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:50,903 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] [2020-12-22 03:53:50,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 03:53:50,903 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2020-12-22 03:53:50,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:50,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055253131] [2020-12-22 03:53:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 03:53:51,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055253131] [2020-12-22 03:53:51,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:51,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 03:53:51,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064047660] [2020-12-22 03:53:51,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 03:53:51,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 03:53:51,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-22 03:53:51,111 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 7 states. [2020-12-22 03:53:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:51,699 INFO L93 Difference]: Finished difference Result 246 states and 274 transitions. [2020-12-22 03:53:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 03:53:51,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-22 03:53:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:51,703 INFO L225 Difference]: With dead ends: 246 [2020-12-22 03:53:51,704 INFO L226 Difference]: Without dead ends: 244 [2020-12-22 03:53:51,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-22 03:53:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-12-22 03:53:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 105. [2020-12-22 03:53:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-12-22 03:53:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2020-12-22 03:53:51,715 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 24 [2020-12-22 03:53:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:51,715 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2020-12-22 03:53:51,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 03:53:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2020-12-22 03:53:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 03:53:51,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:51,717 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, 1] [2020-12-22 03:53:51,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 03:53:51,718 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2020-12-22 03:53:51,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:51,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997660882] [2020-12-22 03:53:51,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 03:53:51,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997660882] [2020-12-22 03:53:51,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:51,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 03:53:51,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746056762] [2020-12-22 03:53:51,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 03:53:51,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:51,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 03:53:51,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 03:53:51,782 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 5 states. [2020-12-22 03:53:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:51,938 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2020-12-22 03:53:51,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 03:53:51,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-12-22 03:53:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:51,940 INFO L225 Difference]: With dead ends: 156 [2020-12-22 03:53:51,940 INFO L226 Difference]: Without dead ends: 138 [2020-12-22 03:53:51,941 INFO L677 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 [2020-12-22 03:53:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-12-22 03:53:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2020-12-22 03:53:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-12-22 03:53:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2020-12-22 03:53:51,950 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 26 [2020-12-22 03:53:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:51,951 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2020-12-22 03:53:51,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 03:53:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2020-12-22 03:53:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 03:53:51,952 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:51,952 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, 1] [2020-12-22 03:53:51,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 03:53:51,953 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:51,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:51,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2020-12-22 03:53:51,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:51,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222145326] [2020-12-22 03:53:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 03:53:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 03:53:51,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222145326] [2020-12-22 03:53:51,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 03:53:51,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 03:53:51,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010882236] [2020-12-22 03:53:51,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 03:53:51,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 03:53:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 03:53:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 03:53:51,988 INFO L87 Difference]: Start difference. First operand 130 states and 153 transitions. Second operand 3 states. [2020-12-22 03:53:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 03:53:52,040 INFO L93 Difference]: Finished difference Result 130 states and 153 transitions. [2020-12-22 03:53:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 03:53:52,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-22 03:53:52,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 03:53:52,042 INFO L225 Difference]: With dead ends: 130 [2020-12-22 03:53:52,042 INFO L226 Difference]: Without dead ends: 128 [2020-12-22 03:53:52,043 INFO L677 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 [2020-12-22 03:53:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-12-22 03:53:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-12-22 03:53:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-22 03:53:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2020-12-22 03:53:52,052 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 151 transitions. Word has length 26 [2020-12-22 03:53:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 03:53:52,053 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 151 transitions. [2020-12-22 03:53:52,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 03:53:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 151 transitions. [2020-12-22 03:53:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 03:53:52,054 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 03:53:52,054 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, 1, 1] [2020-12-22 03:53:52,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 03:53:52,055 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 03:53:52,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 03:53:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2020-12-22 03:53:52,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 03:53:52,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301027937] [2020-12-22 03:53:52,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 03:53:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 03:53:52,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 03:53:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 03:53:52,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 03:53:52,141 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 03:53:52,141 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 03:53:52,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 03:53:52,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 03:53:52 BoogieIcfgContainer [2020-12-22 03:53:52,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 03:53:52,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 03:53:52,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 03:53:52,184 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 03:53:52,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 03:53:48" (3/4) ... [2020-12-22 03:53:52,187 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 03:53:52,239 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/forester-heap/dll-01-1.i-witness.graphml [2020-12-22 03:53:52,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 03:53:52,242 INFO L168 Benchmark]: Toolchain (without parser) took 5921.32 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 125.1 MB in the beginning and 63.6 MB in the end (delta: 61.5 MB). Peak memory consumption was 94.5 MB. Max. memory is 8.0 GB. [2020-12-22 03:53:52,242 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 122.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 03:53:52,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.01 ms. Allocated memory is still 151.0 MB. Free memory was 124.7 MB in the beginning and 100.2 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2020-12-22 03:53:52,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.68 ms. Allocated memory is still 151.0 MB. Free memory was 100.0 MB in the beginning and 132.2 MB in the end (delta: -32.3 MB). Peak memory consumption was 4.9 MB. Max. memory is 8.0 GB. [2020-12-22 03:53:52,244 INFO L168 Benchmark]: Boogie Preprocessor took 84.68 ms. Allocated memory is still 151.0 MB. Free memory was 132.2 MB in the beginning and 130.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 03:53:52,244 INFO L168 Benchmark]: RCFGBuilder took 829.97 ms. Allocated memory is still 151.0 MB. Free memory was 130.1 MB in the beginning and 95.5 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. [2020-12-22 03:53:52,245 INFO L168 Benchmark]: TraceAbstraction took 3970.03 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 95.0 MB in the beginning and 66.7 MB in the end (delta: 28.3 MB). Peak memory consumption was 60.2 MB. Max. memory is 8.0 GB. [2020-12-22 03:53:52,245 INFO L168 Benchmark]: Witness Printer took 55.99 ms. Allocated memory is still 181.4 MB. Free memory was 66.7 MB in the beginning and 63.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 03:53:52,249 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.23 ms. Allocated memory is still 151.0 MB. Free memory is still 122.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 833.01 ms. Allocated memory is still 151.0 MB. Free memory was 124.7 MB in the beginning and 100.2 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 137.68 ms. Allocated memory is still 151.0 MB. Free memory was 100.0 MB in the beginning and 132.2 MB in the end (delta: -32.3 MB). Peak memory consumption was 4.9 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 84.68 ms. Allocated memory is still 151.0 MB. Free memory was 132.2 MB in the beginning and 130.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 829.97 ms. Allocated memory is still 151.0 MB. Free memory was 130.1 MB in the beginning and 95.5 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3970.03 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 95.0 MB in the beginning and 66.7 MB in the end (delta: 28.3 MB). Peak memory consumption was 60.2 MB. Max. memory is 8.0 GB. * Witness Printer took 55.99 ms. Allocated memory is still 181.4 MB. Free memory was 66.7 MB in the beginning and 63.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) [L1005] list->prev = ((void*)0) [L1006] COND FALSE !(!(list != ((void*)0))) [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) [L1006] EXPR list->inner [L1006] list->inner->next = ((void*)0) [L1006] EXPR list->inner [L1006] list->inner->inner = ((void*)0) [L1006] EXPR list->inner [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list [L1026] COND FALSE !(!(((void*)0) != end)) [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; [L1031] EXPR end->inner [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner [L1034] COND TRUE len == 0 [L1035] len = 1 [L1038] COND FALSE !(!(((void*)0) != inner)) [L1039] EXPR inner->inner [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 943 SDtfs, 1062 SDslu, 1246 SDs, 0 SdLazy, 657 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 389 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 33174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 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...