java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:32,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:32,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:32,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:32,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:32,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:32,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:32,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:32,031 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:32,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:32,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:32,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:32,038 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:32,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:32,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:32,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:32,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:32,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:32,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:32,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:32,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:32,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:32,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:32,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:32,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:32,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:32,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:32,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:32,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:32,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:32,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:32,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:32,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:32,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:32,087 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:32,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:32,088 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:42:32,116 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:32,116 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:32,118 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:32,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:32,118 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:32,118 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:32,118 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:32,119 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:32,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:32,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:32,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:32,119 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:32,119 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:32,120 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:32,121 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:32,121 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:32,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:32,121 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:32,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:32,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:32,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:32,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:32,122 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:32,123 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:32,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:32,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:42:32,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:32,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:32,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:32,206 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:32,206 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:32,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:32,529 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f8c14b5/8b7de7dc18e946949ecfbaa6dd984170/FLAG685d5154e [2018-10-10 14:42:32,835 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:32,836 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:32,852 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f8c14b5/8b7de7dc18e946949ecfbaa6dd984170/FLAG685d5154e [2018-10-10 14:42:32,866 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88f8c14b5/8b7de7dc18e946949ecfbaa6dd984170 [2018-10-10 14:42:32,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:32,877 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:32,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:32,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:32,882 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:32,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:32" (1/1) ... [2018-10-10 14:42:32,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202fa69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:32, skipping insertion in model container [2018-10-10 14:42:32,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:32" (1/1) ... [2018-10-10 14:42:32,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:32,939 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:33,157 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:33,167 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:33,242 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:33,293 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:33,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33 WrapperNode [2018-10-10 14:42:33,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:33,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:33,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:33,295 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:33,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (1/1) ... [2018-10-10 14:42:33,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (1/1) ... [2018-10-10 14:42:33,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:33,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:33,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:33,354 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:33,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (1/1) ... [2018-10-10 14:42:33,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (1/1) ... [2018-10-10 14:42:33,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (1/1) ... [2018-10-10 14:42:33,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (1/1) ... [2018-10-10 14:42:33,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (1/1) ... [2018-10-10 14:42:33,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (1/1) ... [2018-10-10 14:42:33,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (1/1) ... [2018-10-10 14:42:33,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:33,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:33,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:33,387 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:33,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (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 [2018-10-10 14:42:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:33,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:34,328 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:34,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:34 BoogieIcfgContainer [2018-10-10 14:42:34,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:34,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:34,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:34,334 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:34,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:32" (1/3) ... [2018-10-10 14:42:34,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5934bc89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:34, skipping insertion in model container [2018-10-10 14:42:34,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:33" (2/3) ... [2018-10-10 14:42:34,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5934bc89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:34, skipping insertion in model container [2018-10-10 14:42:34,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:34" (3/3) ... [2018-10-10 14:42:34,338 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:34,346 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:34,354 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-10-10 14:42:34,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-10-10 14:42:34,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:34,400 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:34,401 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:34,401 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:34,401 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:34,402 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:34,402 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:34,402 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:34,402 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2018-10-10 14:42:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:42:34,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:34,435 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:34,438 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:34,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:42:34,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:34,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:34,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:34,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:34,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:34,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:34,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:34,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:34,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:34,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:34,956 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 8 states. [2018-10-10 14:42:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:36,061 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-10-10 14:42:36,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:36,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:42:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:36,075 INFO L225 Difference]: With dead ends: 147 [2018-10-10 14:42:36,075 INFO L226 Difference]: Without dead ends: 142 [2018-10-10 14:42:36,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-10 14:42:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-10-10 14:42:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-10 14:42:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2018-10-10 14:42:36,121 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 46 [2018-10-10 14:42:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:36,122 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2018-10-10 14:42:36,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2018-10-10 14:42:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:36,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:36,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:36,124 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:36,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:42:36,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:36,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:36,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:36,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:36,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:36,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:36,628 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand 13 states. [2018-10-10 14:42:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:37,742 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-10-10 14:42:37,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:37,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:42:37,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:37,746 INFO L225 Difference]: With dead ends: 141 [2018-10-10 14:42:37,746 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 14:42:37,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:42:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 14:42:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-10-10 14:42:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-10 14:42:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2018-10-10 14:42:37,759 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 47 [2018-10-10 14:42:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:37,760 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2018-10-10 14:42:37,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-10-10 14:42:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:42:37,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:37,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:37,763 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:37,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:42:37,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:37,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:37,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:37,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:37,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:37,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:37,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:37,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:37,862 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 6 states. [2018-10-10 14:42:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:38,058 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-10-10 14:42:38,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:38,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:42:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:38,061 INFO L225 Difference]: With dead ends: 140 [2018-10-10 14:42:38,062 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 14:42:38,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 14:42:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-10-10 14:42:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-10 14:42:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-10-10 14:42:38,071 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 56 [2018-10-10 14:42:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:38,072 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-10-10 14:42:38,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-10-10 14:42:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:42:38,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:38,074 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:38,075 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:38,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:42:38,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:38,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:38,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:38,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:38,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:38,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:38,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:38,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:38,305 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 9 states. [2018-10-10 14:42:38,951 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-10 14:42:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:38,953 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-10-10 14:42:38,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:38,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:42:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:38,955 INFO L225 Difference]: With dead ends: 139 [2018-10-10 14:42:38,955 INFO L226 Difference]: Without dead ends: 139 [2018-10-10 14:42:38,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-10 14:42:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-10 14:42:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-10 14:42:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-10-10 14:42:38,965 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 57 [2018-10-10 14:42:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:38,966 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-10-10 14:42:38,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-10-10 14:42:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 14:42:38,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:38,975 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:38,975 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:38,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:38,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1929385874, now seen corresponding path program 1 times [2018-10-10 14:42:38,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:38,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:38,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:38,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:38,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:39,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:39,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:39,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:39,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:39,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:39,157 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 9 states. [2018-10-10 14:42:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:39,568 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-10-10 14:42:39,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:39,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2018-10-10 14:42:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:39,572 INFO L225 Difference]: With dead ends: 143 [2018-10-10 14:42:39,572 INFO L226 Difference]: Without dead ends: 143 [2018-10-10 14:42:39,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-10 14:42:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2018-10-10 14:42:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 14:42:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2018-10-10 14:42:39,580 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 77 [2018-10-10 14:42:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:39,581 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2018-10-10 14:42:39,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-10-10 14:42:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-10 14:42:39,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:39,584 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:39,585 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:39,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:39,585 INFO L82 PathProgramCache]: Analyzing trace with hash 318580180, now seen corresponding path program 1 times [2018-10-10 14:42:39,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:39,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:39,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:39,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:39,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:39,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:39,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:39,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:39,906 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand 12 states. [2018-10-10 14:42:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:40,638 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2018-10-10 14:42:40,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:42:40,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-10-10 14:42:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:40,640 INFO L225 Difference]: With dead ends: 184 [2018-10-10 14:42:40,640 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 14:42:40,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-10-10 14:42:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 14:42:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 145. [2018-10-10 14:42:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 14:42:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-10-10 14:42:40,648 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 78 [2018-10-10 14:42:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:40,649 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-10-10 14:42:40,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-10-10 14:42:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:42:40,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:40,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:40,652 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:40,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1657198568, now seen corresponding path program 1 times [2018-10-10 14:42:40,652 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:40,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:40,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:40,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:40,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:40,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:40,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:40,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:40,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:40,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:40,929 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 10 states. [2018-10-10 14:42:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:41,453 INFO L93 Difference]: Finished difference Result 166 states and 171 transitions. [2018-10-10 14:42:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:41,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-10-10 14:42:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:41,456 INFO L225 Difference]: With dead ends: 166 [2018-10-10 14:42:41,456 INFO L226 Difference]: Without dead ends: 166 [2018-10-10 14:42:41,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:42:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-10 14:42:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 144. [2018-10-10 14:42:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 14:42:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2018-10-10 14:42:41,463 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 95 [2018-10-10 14:42:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:41,464 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2018-10-10 14:42:41,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2018-10-10 14:42:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 14:42:41,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:41,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:41,467 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:41,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:41,467 INFO L82 PathProgramCache]: Analyzing trace with hash 166452103, now seen corresponding path program 1 times [2018-10-10 14:42:41,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:41,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:41,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:41,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:41,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:42,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:42,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:42,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:42,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:42,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:42,307 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 13 states. [2018-10-10 14:42:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:43,074 INFO L93 Difference]: Finished difference Result 195 states and 200 transitions. [2018-10-10 14:42:43,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:42:43,075 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2018-10-10 14:42:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:43,077 INFO L225 Difference]: With dead ends: 195 [2018-10-10 14:42:43,077 INFO L226 Difference]: Without dead ends: 195 [2018-10-10 14:42:43,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:42:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-10 14:42:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 151. [2018-10-10 14:42:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-10 14:42:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-10-10 14:42:43,082 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 96 [2018-10-10 14:42:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:43,083 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-10-10 14:42:43,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-10-10 14:42:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 14:42:43,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:43,085 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:43,085 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:43,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:43,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1108210136, now seen corresponding path program 1 times [2018-10-10 14:42:43,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:43,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:43,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:43,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:43,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:43,755 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:42:44,031 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2018-10-10 14:42:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:44,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:44,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:42:44,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:42:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:42:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:44,585 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 16 states. [2018-10-10 14:42:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:45,756 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-10-10 14:42:45,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:45,756 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-10-10 14:42:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:45,758 INFO L225 Difference]: With dead ends: 150 [2018-10-10 14:42:45,758 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 14:42:45,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:42:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 14:42:45,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-10 14:42:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-10 14:42:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2018-10-10 14:42:45,762 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 108 [2018-10-10 14:42:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:45,763 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2018-10-10 14:42:45,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:42:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2018-10-10 14:42:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 14:42:45,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:45,765 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:45,765 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:45,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:45,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1470227887, now seen corresponding path program 1 times [2018-10-10 14:42:45,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:45,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:46,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:46,569 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:46,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:46,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:46,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:46,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:46,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:46,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:46,899 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:46,924 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:46,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:46,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:46,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:46,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:47,716 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:42:48,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:48,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:48,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:48,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-10-10 14:42:48,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-10 14:42:48,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:48,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:48,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2018-10-10 14:42:48,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:48,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:48,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:48,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:48,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:48,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-10 14:42:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:49,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:49,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 43 [2018-10-10 14:42:49,596 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:42:49,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 14:42:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 14:42:49,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1772, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 14:42:49,602 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand 44 states. [2018-10-10 14:42:50,768 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-10-10 14:42:50,951 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2018-10-10 14:42:52,158 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-10-10 14:42:52,400 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2018-10-10 14:42:52,656 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2018-10-10 14:42:52,929 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2018-10-10 14:42:53,137 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-10-10 14:42:53,747 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-10-10 14:42:53,990 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-10-10 14:42:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:54,063 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2018-10-10 14:42:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 14:42:54,064 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 113 [2018-10-10 14:42:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:54,067 INFO L225 Difference]: With dead ends: 189 [2018-10-10 14:42:54,067 INFO L226 Difference]: Without dead ends: 189 [2018-10-10 14:42:54,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=841, Invalid=4561, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 14:42:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-10 14:42:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2018-10-10 14:42:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-10 14:42:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 177 transitions. [2018-10-10 14:42:54,074 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 177 transitions. Word has length 113 [2018-10-10 14:42:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:54,075 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 177 transitions. [2018-10-10 14:42:54,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 14:42:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2018-10-10 14:42:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-10 14:42:54,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:54,076 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:54,077 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:54,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1706656312, now seen corresponding path program 1 times [2018-10-10 14:42:54,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:54,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:54,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:54,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:54,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:54,877 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:54,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:54,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:54,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:54,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:54,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:54,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:42:55,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:55,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:55,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:55,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:55,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:55,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:42:55,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:55,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:55,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:55,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:55,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:55,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-10 14:42:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:56,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:56,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2018-10-10 14:42:56,110 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_11.bpl [2018-10-10 14:42:56,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 14:42:56,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 14:42:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1230, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 14:42:56,113 INFO L87 Difference]: Start difference. First operand 172 states and 177 transitions. Second operand 37 states. [2018-10-10 14:42:57,789 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-10-10 14:42:58,049 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-10-10 14:42:58,387 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2018-10-10 14:42:58,891 WARN L178 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2018-10-10 14:42:59,140 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2018-10-10 14:42:59,374 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2018-10-10 14:42:59,603 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2018-10-10 14:43:00,200 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2018-10-10 14:43:00,422 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-10-10 14:43:00,978 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-10-10 14:43:01,204 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2018-10-10 14:43:01,422 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-10-10 14:43:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:01,677 INFO L93 Difference]: Finished difference Result 284 states and 293 transitions. [2018-10-10 14:43:01,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 14:43:01,678 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 114 [2018-10-10 14:43:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:01,680 INFO L225 Difference]: With dead ends: 284 [2018-10-10 14:43:01,680 INFO L226 Difference]: Without dead ends: 284 [2018-10-10 14:43:01,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=893, Invalid=3267, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 14:43:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-10 14:43:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 208. [2018-10-10 14:43:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-10 14:43:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 215 transitions. [2018-10-10 14:43:01,688 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 215 transitions. Word has length 114 [2018-10-10 14:43:01,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:01,689 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 215 transitions. [2018-10-10 14:43:01,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 14:43:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 215 transitions. [2018-10-10 14:43:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-10 14:43:01,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:01,690 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:01,691 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:01,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:01,691 INFO L82 PathProgramCache]: Analyzing trace with hash -159957335, now seen corresponding path program 2 times [2018-10-10 14:43:01,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:01,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:01,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:01,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:02,388 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-10 14:43:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:03,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:03,216 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:03,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:43:03,265 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:43:03,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:43:03,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:03,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:43:03,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:03,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:03,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:43:03,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:43:03,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:43:03,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:03,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:03,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:03,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2018-10-10 14:43:04,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:43:04,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:43:04,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:04,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:04,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:04,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-10-10 14:43:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:04,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:04,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-10-10 14:43:04,913 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:04,917 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:04,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:04 BoogieIcfgContainer [2018-10-10 14:43:04,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:04,919 INFO L168 Benchmark]: Toolchain (without parser) took 32042.77 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:04,919 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:04,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:04,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:04,921 INFO L168 Benchmark]: Boogie Preprocessor took 32.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:04,921 INFO L168 Benchmark]: RCFGBuilder took 942.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.1 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:04,922 INFO L168 Benchmark]: TraceAbstraction took 30587.73 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 318.8 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -312.3 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:04,926 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 416.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 942.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.1 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30587.73 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 318.8 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -312.3 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 552). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 9 error locations. TIMEOUT Result, 30.5s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 16.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1306 SDtfs, 7558 SDslu, 7789 SDs, 0 SdLazy, 4069 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 203 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1114 NumberOfCodeBlocks, 1114 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1101 ConstructedInterpolants, 70 QuantifiedInterpolants, 940889 SizeOfPredicates, 69 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 0/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...