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_cstpncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:02,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:02,516 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:02,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:02,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:02,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:02,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:02,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:02,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:02,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:02,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:02,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:02,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:02,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:02,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:02,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:02,540 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:02,542 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:02,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:02,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:02,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:02,548 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:02,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:02,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:02,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:02,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:02,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:02,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:02,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:02,555 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:02,555 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:02,556 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:02,556 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:02,556 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:02,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:02,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:02,558 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:02,573 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:02,574 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:02,575 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:02,575 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:02,575 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:02,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:02,576 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:02,576 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:02,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:02,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:02,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:02,577 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:02,577 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:02,577 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:02,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:02,578 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:02,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:02,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:02,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:02,579 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:02,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:02,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:02,579 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:02,579 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:02,579 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:02,580 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:02,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:02,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:02,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:02,681 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:02,681 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:02,682 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:02,986 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3321430/4aa64ce61d1d4b67960b6f10c9230873/FLAG76d79b2cf [2018-10-10 14:42:03,226 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:03,227 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:03,242 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3321430/4aa64ce61d1d4b67960b6f10c9230873/FLAG76d79b2cf [2018-10-10 14:42:03,260 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3321430/4aa64ce61d1d4b67960b6f10c9230873 [2018-10-10 14:42:03,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:03,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:03,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:03,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:03,280 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:03,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:03" (1/1) ... [2018-10-10 14:42:03,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44821726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:03, skipping insertion in model container [2018-10-10 14:42:03,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:03" (1/1) ... [2018-10-10 14:42:03,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:03,357 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:03,623 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:03,634 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:03,704 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:03,775 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:03,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:03 WrapperNode [2018-10-10 14:42:03,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:03,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:03,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:03,777 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:03,786 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:03" (1/1) ... [2018-10-10 14:42:03,809 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:03" (1/1) ... [2018-10-10 14:42:03,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:03,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:03,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:03,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:03,856 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:03" (1/1) ... [2018-10-10 14:42:03,857 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:03" (1/1) ... [2018-10-10 14:42:03,862 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:03" (1/1) ... [2018-10-10 14:42:03,862 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:03" (1/1) ... [2018-10-10 14:42:03,871 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:03" (1/1) ... [2018-10-10 14:42:03,876 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:03" (1/1) ... [2018-10-10 14:42:03,879 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:03" (1/1) ... [2018-10-10 14:42:03,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:03,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:03,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:03,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:03,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:03" (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:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:04,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:05,189 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:05,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:05 BoogieIcfgContainer [2018-10-10 14:42:05,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:05,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:05,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:05,195 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:05,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:03" (1/3) ... [2018-10-10 14:42:05,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d0b0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:05, skipping insertion in model container [2018-10-10 14:42:05,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:03" (2/3) ... [2018-10-10 14:42:05,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d0b0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:05, skipping insertion in model container [2018-10-10 14:42:05,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:05" (3/3) ... [2018-10-10 14:42:05,199 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:05,209 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:05,218 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-10-10 14:42:05,237 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-10-10 14:42:05,265 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:05,265 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:05,266 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:05,266 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:05,266 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:05,266 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:05,266 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:05,267 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:05,267 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2018-10-10 14:42:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:42:05,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:05,311 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:05,313 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:05,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:42:05,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:05,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:05,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:05,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:05,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:05,715 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:05,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:05,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:05,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:05,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:05,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:05,742 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 6 states. [2018-10-10 14:42:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:06,752 INFO L93 Difference]: Finished difference Result 284 states and 289 transitions. [2018-10-10 14:42:06,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:42:06,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-10 14:42:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:06,773 INFO L225 Difference]: With dead ends: 284 [2018-10-10 14:42:06,774 INFO L226 Difference]: Without dead ends: 279 [2018-10-10 14:42:06,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-10 14:42:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 241. [2018-10-10 14:42:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-10 14:42:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 246 transitions. [2018-10-10 14:42:06,832 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 246 transitions. Word has length 46 [2018-10-10 14:42:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:06,833 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 246 transitions. [2018-10-10 14:42:06,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 246 transitions. [2018-10-10 14:42:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:06,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:06,835 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:06,837 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:06,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:06,838 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:42:06,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:06,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:06,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:06,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:06,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:07,361 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:07,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:07,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:07,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:07,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:07,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:07,365 INFO L87 Difference]: Start difference. First operand 241 states and 246 transitions. Second operand 9 states. [2018-10-10 14:42:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:08,269 INFO L93 Difference]: Finished difference Result 240 states and 245 transitions. [2018-10-10 14:42:08,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:08,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-10-10 14:42:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:08,279 INFO L225 Difference]: With dead ends: 240 [2018-10-10 14:42:08,279 INFO L226 Difference]: Without dead ends: 240 [2018-10-10 14:42:08,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-10 14:42:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-10-10 14:42:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-10 14:42:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 245 transitions. [2018-10-10 14:42:08,306 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 245 transitions. Word has length 47 [2018-10-10 14:42:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:08,306 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 245 transitions. [2018-10-10 14:42:08,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 245 transitions. [2018-10-10 14:42:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-10 14:42:08,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:08,310 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] [2018-10-10 14:42:08,311 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:08,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1672953971, now seen corresponding path program 1 times [2018-10-10 14:42:08,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:08,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:08,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:08,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:08,424 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:08,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:08,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:42:08,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:42:08,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:42:08,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:42:08,429 INFO L87 Difference]: Start difference. First operand 240 states and 245 transitions. Second operand 5 states. [2018-10-10 14:42:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:08,717 INFO L93 Difference]: Finished difference Result 237 states and 242 transitions. [2018-10-10 14:42:08,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:42:08,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-10-10 14:42:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:08,721 INFO L225 Difference]: With dead ends: 237 [2018-10-10 14:42:08,721 INFO L226 Difference]: Without dead ends: 237 [2018-10-10 14:42:08,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:42:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-10 14:42:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-10 14:42:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-10 14:42:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 242 transitions. [2018-10-10 14:42:08,733 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 242 transitions. Word has length 72 [2018-10-10 14:42:08,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:08,734 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 242 transitions. [2018-10-10 14:42:08,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:42:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 242 transitions. [2018-10-10 14:42:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 14:42:08,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:08,741 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] [2018-10-10 14:42:08,742 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:08,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:08,743 INFO L82 PathProgramCache]: Analyzing trace with hash -321965430, now seen corresponding path program 1 times [2018-10-10 14:42:08,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:08,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:08,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:08,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:08,894 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:08,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:08,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:42:08,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:42:08,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:42:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:42:08,896 INFO L87 Difference]: Start difference. First operand 237 states and 242 transitions. Second operand 7 states. [2018-10-10 14:42:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:09,515 INFO L93 Difference]: Finished difference Result 234 states and 239 transitions. [2018-10-10 14:42:09,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:42:09,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-10-10 14:42:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:09,517 INFO L225 Difference]: With dead ends: 234 [2018-10-10 14:42:09,518 INFO L226 Difference]: Without dead ends: 234 [2018-10-10 14:42:09,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-10 14:42:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-10-10 14:42:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 14:42:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 239 transitions. [2018-10-10 14:42:09,539 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 239 transitions. Word has length 73 [2018-10-10 14:42:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:09,539 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 239 transitions. [2018-10-10 14:42:09,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:42:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 239 transitions. [2018-10-10 14:42:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 14:42:09,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:09,542 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] [2018-10-10 14:42:09,543 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:09,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:09,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1943652661, now seen corresponding path program 1 times [2018-10-10 14:42:09,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:09,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:09,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:09,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:09,659 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:09,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:09,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:42:09,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:42:09,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:42:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:42:09,661 INFO L87 Difference]: Start difference. First operand 234 states and 239 transitions. Second operand 5 states. [2018-10-10 14:42:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:09,926 INFO L93 Difference]: Finished difference Result 233 states and 238 transitions. [2018-10-10 14:42:09,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:42:09,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-10-10 14:42:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:09,931 INFO L225 Difference]: With dead ends: 233 [2018-10-10 14:42:09,931 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 14:42:09,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:42:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 14:42:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-10-10 14:42:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 14:42:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 236 transitions. [2018-10-10 14:42:09,937 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 236 transitions. Word has length 84 [2018-10-10 14:42:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:09,938 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 236 transitions. [2018-10-10 14:42:09,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:42:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 236 transitions. [2018-10-10 14:42:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 14:42:09,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:09,940 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] [2018-10-10 14:42:09,941 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:09,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:09,941 INFO L82 PathProgramCache]: Analyzing trace with hash 123690625, now seen corresponding path program 1 times [2018-10-10 14:42:09,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:09,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:09,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:10,111 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:10,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:10,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:42:10,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:42:10,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:42:10,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:42:10,112 INFO L87 Difference]: Start difference. First operand 231 states and 236 transitions. Second operand 7 states. [2018-10-10 14:42:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:10,335 INFO L93 Difference]: Finished difference Result 230 states and 235 transitions. [2018-10-10 14:42:10,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:42:10,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-10-10 14:42:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:10,338 INFO L225 Difference]: With dead ends: 230 [2018-10-10 14:42:10,338 INFO L226 Difference]: Without dead ends: 230 [2018-10-10 14:42:10,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-10 14:42:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-10 14:42:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 14:42:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 233 transitions. [2018-10-10 14:42:10,344 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 233 transitions. Word has length 85 [2018-10-10 14:42:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:10,345 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 233 transitions. [2018-10-10 14:42:10,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:42:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 233 transitions. [2018-10-10 14:42:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 14:42:10,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:10,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:10,349 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:10,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:10,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1445622293, now seen corresponding path program 1 times [2018-10-10 14:42:10,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:10,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:10,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:10,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:10,633 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:10,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:10,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:10,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:42:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:42:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:42:10,635 INFO L87 Difference]: Start difference. First operand 228 states and 233 transitions. Second operand 7 states. [2018-10-10 14:42:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:10,735 INFO L93 Difference]: Finished difference Result 279 states and 284 transitions. [2018-10-10 14:42:10,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:42:10,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-10-10 14:42:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:10,738 INFO L225 Difference]: With dead ends: 279 [2018-10-10 14:42:10,739 INFO L226 Difference]: Without dead ends: 279 [2018-10-10 14:42:10,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-10 14:42:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 228. [2018-10-10 14:42:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 14:42:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 232 transitions. [2018-10-10 14:42:10,745 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 232 transitions. Word has length 119 [2018-10-10 14:42:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:10,746 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 232 transitions. [2018-10-10 14:42:10,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:42:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2018-10-10 14:42:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-10 14:42:10,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:10,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:10,749 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:10,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash -958340183, now seen corresponding path program 1 times [2018-10-10 14:42:10,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:10,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:11,130 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:11,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:11,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:11,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:11,133 INFO L87 Difference]: Start difference. First operand 228 states and 232 transitions. Second operand 12 states. [2018-10-10 14:42:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:11,841 INFO L93 Difference]: Finished difference Result 246 states and 250 transitions. [2018-10-10 14:42:11,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:42:11,841 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 123 [2018-10-10 14:42:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:11,844 INFO L225 Difference]: With dead ends: 246 [2018-10-10 14:42:11,844 INFO L226 Difference]: Without dead ends: 246 [2018-10-10 14:42:11,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:42:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-10 14:42:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 227. [2018-10-10 14:42:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-10 14:42:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2018-10-10 14:42:11,850 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 123 [2018-10-10 14:42:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:11,851 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2018-10-10 14:42:11,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2018-10-10 14:42:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-10 14:42:11,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:11,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:11,853 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:11,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash 356225582, now seen corresponding path program 1 times [2018-10-10 14:42:11,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:11,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:11,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:11,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:11,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:12,387 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:12,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:12,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-10 14:42:12,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 14:42:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 14:42:12,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:42:12,389 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 18 states. [2018-10-10 14:42:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:14,254 INFO L93 Difference]: Finished difference Result 343 states and 349 transitions. [2018-10-10 14:42:14,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 14:42:14,254 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-10-10 14:42:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:14,256 INFO L225 Difference]: With dead ends: 343 [2018-10-10 14:42:14,256 INFO L226 Difference]: Without dead ends: 343 [2018-10-10 14:42:14,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=387, Invalid=1253, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 14:42:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-10 14:42:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 236. [2018-10-10 14:42:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-10 14:42:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 240 transitions. [2018-10-10 14:42:14,263 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 240 transitions. Word has length 124 [2018-10-10 14:42:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:14,264 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 240 transitions. [2018-10-10 14:42:14,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 14:42:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 240 transitions. [2018-10-10 14:42:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 14:42:14,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:14,266 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, 1, 1, 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:14,266 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:14,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1511672756, now seen corresponding path program 1 times [2018-10-10 14:42:14,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:14,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:14,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:14,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:14,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:14,765 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:14,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:14,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-10 14:42:14,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 14:42:14,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 14:42:14,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:42:14,767 INFO L87 Difference]: Start difference. First operand 236 states and 240 transitions. Second operand 18 states. [2018-10-10 14:42:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:16,738 INFO L93 Difference]: Finished difference Result 284 states and 289 transitions. [2018-10-10 14:42:16,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 14:42:16,739 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 134 [2018-10-10 14:42:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:16,742 INFO L225 Difference]: With dead ends: 284 [2018-10-10 14:42:16,742 INFO L226 Difference]: Without dead ends: 284 [2018-10-10 14:42:16,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=613, Invalid=1937, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 14:42:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-10 14:42:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 235. [2018-10-10 14:42:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-10 14:42:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 239 transitions. [2018-10-10 14:42:16,747 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 239 transitions. Word has length 134 [2018-10-10 14:42:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:16,748 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 239 transitions. [2018-10-10 14:42:16,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 14:42:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 239 transitions. [2018-10-10 14:42:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-10 14:42:16,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:16,749 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, 1, 1, 1, 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:16,750 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:16,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:16,751 INFO L82 PathProgramCache]: Analyzing trace with hash -382784624, now seen corresponding path program 1 times [2018-10-10 14:42:16,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:16,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:16,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:16,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:17,800 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:17,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:17,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-10-10 14:42:17,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 14:42:17,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 14:42:17,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:42:17,802 INFO L87 Difference]: Start difference. First operand 235 states and 239 transitions. Second operand 24 states. [2018-10-10 14:42:19,469 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2018-10-10 14:42:19,660 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2018-10-10 14:42:19,826 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-10-10 14:42:20,682 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-10-10 14:42:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:21,648 INFO L93 Difference]: Finished difference Result 342 states and 348 transitions. [2018-10-10 14:42:21,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 14:42:21,648 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2018-10-10 14:42:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:21,650 INFO L225 Difference]: With dead ends: 342 [2018-10-10 14:42:21,650 INFO L226 Difference]: Without dead ends: 342 [2018-10-10 14:42:21,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=702, Invalid=3080, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 14:42:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-10 14:42:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 246. [2018-10-10 14:42:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-10 14:42:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 250 transitions. [2018-10-10 14:42:21,657 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 250 transitions. Word has length 135 [2018-10-10 14:42:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:21,657 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 250 transitions. [2018-10-10 14:42:21,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 14:42:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 250 transitions. [2018-10-10 14:42:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-10 14:42:21,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:21,659 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,660 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:21,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash -484872553, now seen corresponding path program 1 times [2018-10-10 14:42:21,660 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:21,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:21,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:21,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:21,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:22,432 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:42:22,729 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-10 14:42:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:23,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:23,534 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:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:23,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:24,034 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:24,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:42:24,217 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:24,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-10-10 14:42:24,592 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 16 treesize of output 13 [2018-10-10 14:42:24,606 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 13 treesize of output 12 [2018-10-10 14:42:24,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-10 14:42:24,904 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:24,905 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:24,906 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:24,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-10-10 14:42:24,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-10-10 14:42:24,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-10-10 14:42:25,354 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 19 treesize of output 15 [2018-10-10 14:42:25,364 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 15 treesize of output 12 [2018-10-10 14:42:25,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:25,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:25,384 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:25,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:27 [2018-10-10 14:42:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:26,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:26,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-10 14:42:26,086 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_12.bpl [2018-10-10 14:42:26,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 14:42:26,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 14:42:26,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2132, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 14:42:26,093 INFO L87 Difference]: Start difference. First operand 246 states and 250 transitions. Second operand 48 states. [2018-10-10 14:42:27,217 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2018-10-10 14:42:27,461 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2018-10-10 14:42:27,695 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-10-10 14:42:27,878 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-10-10 14:42:28,188 WARN L178 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-10-10 14:42:30,287 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-10-10 14:42:30,457 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-10-10 14:42:30,725 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-10-10 14:42:30,945 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2018-10-10 14:42:31,208 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2018-10-10 14:42:31,450 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2018-10-10 14:42:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:33,197 INFO L93 Difference]: Finished difference Result 487 states and 494 transitions. [2018-10-10 14:42:33,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 14:42:33,198 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 157 [2018-10-10 14:42:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:33,200 INFO L225 Difference]: With dead ends: 487 [2018-10-10 14:42:33,200 INFO L226 Difference]: Without dead ends: 487 [2018-10-10 14:42:33,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=546, Invalid=4710, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 14:42:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-10-10 14:42:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 268. [2018-10-10 14:42:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-10 14:42:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 274 transitions. [2018-10-10 14:42:33,209 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 274 transitions. Word has length 157 [2018-10-10 14:42:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:33,210 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 274 transitions. [2018-10-10 14:42:33,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 14:42:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 274 transitions. [2018-10-10 14:42:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-10 14:42:33,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:33,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,212 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:33,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 738854758, now seen corresponding path program 1 times [2018-10-10 14:42:33,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:33,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:33,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:33,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:33,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:33,434 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:33,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:33,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:42:33,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:42:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:42:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:42:33,435 INFO L87 Difference]: Start difference. First operand 268 states and 274 transitions. Second operand 7 states. [2018-10-10 14:42:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:33,725 INFO L93 Difference]: Finished difference Result 314 states and 320 transitions. [2018-10-10 14:42:33,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:33,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2018-10-10 14:42:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:33,728 INFO L225 Difference]: With dead ends: 314 [2018-10-10 14:42:33,728 INFO L226 Difference]: Without dead ends: 314 [2018-10-10 14:42:33,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-10 14:42:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 267. [2018-10-10 14:42:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-10 14:42:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 273 transitions. [2018-10-10 14:42:33,735 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 273 transitions. Word has length 165 [2018-10-10 14:42:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:33,735 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 273 transitions. [2018-10-10 14:42:33,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:42:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 273 transitions. [2018-10-10 14:42:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-10 14:42:33,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:33,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,737 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:33,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:33,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1429661260, now seen corresponding path program 1 times [2018-10-10 14:42:33,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:33,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:33,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:33,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:33,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:35,716 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:35,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:35,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2018-10-10 14:42:35,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 14:42:35,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 14:42:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 14:42:35,718 INFO L87 Difference]: Start difference. First operand 267 states and 273 transitions. Second operand 35 states. [2018-10-10 14:42:37,553 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-10 14:42:37,770 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-10-10 14:42:38,073 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2018-10-10 14:42:38,505 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-10-10 14:42:38,879 WARN L178 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2018-10-10 14:42:39,297 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2018-10-10 14:42:39,652 WARN L178 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2018-10-10 14:42:40,141 WARN L178 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-10-10 14:42:40,632 WARN L178 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2018-10-10 14:42:40,905 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-10-10 14:42:41,177 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2018-10-10 14:42:41,402 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2018-10-10 14:42:41,694 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-10-10 14:42:41,989 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-10-10 14:42:42,417 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2018-10-10 14:42:42,734 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-10-10 14:42:44,371 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-10-10 14:42:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:44,402 INFO L93 Difference]: Finished difference Result 349 states and 356 transitions. [2018-10-10 14:42:44,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 14:42:44,403 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 166 [2018-10-10 14:42:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:44,405 INFO L225 Difference]: With dead ends: 349 [2018-10-10 14:42:44,406 INFO L226 Difference]: Without dead ends: 349 [2018-10-10 14:42:44,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=639, Invalid=4763, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 14:42:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-10 14:42:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 292. [2018-10-10 14:42:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-10 14:42:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 299 transitions. [2018-10-10 14:42:44,414 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 299 transitions. Word has length 166 [2018-10-10 14:42:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:44,415 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 299 transitions. [2018-10-10 14:42:44,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 14:42:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 299 transitions. [2018-10-10 14:42:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-10 14:42:44,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:44,416 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,417 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:44,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1859345529, now seen corresponding path program 1 times [2018-10-10 14:42:44,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:44,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:44,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:44,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:44,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:45,080 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:42:45,669 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-10 14:42:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:46,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:46,352 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:46,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:46,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:46,446 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,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:46,458 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,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-10 14:42:46,531 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,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:46,541 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:46,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-10-10 14:42:46,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:46,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:46,760 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,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:46,767 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,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-10-10 14:42:46,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:42:46,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:46,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:46,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-10-10 14:42:47,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-10-10 14:42:47,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:47,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:42:47,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:30 [2018-10-10 14:42:47,453 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 34 treesize of output 31 [2018-10-10 14:42:47,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:47,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,524 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 39 treesize of output 36 [2018-10-10 14:42:47,540 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:47,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,589 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 35 treesize of output 32 [2018-10-10 14:42:47,592 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:47,593 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,604 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,668 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 30 treesize of output 27 [2018-10-10 14:42:47,671 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:47,671 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,680 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:42:47,709 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:74, output treesize:46 [2018-10-10 14:42:47,964 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 39 treesize of output 35 [2018-10-10 14:42:47,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-10 14:42:47,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,994 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,024 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 28 treesize of output 24 [2018-10-10 14:42:48,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2018-10-10 14:42:48,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,058 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 34 treesize of output 30 [2018-10-10 14:42:48,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-10 14:42:48,061 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,110 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,178 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 23 treesize of output 19 [2018-10-10 14:42:48,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2018-10-10 14:42:48,182 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,216 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:42:48,234 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:74, output treesize:30 [2018-10-10 14:42:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:50,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:50,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 58 [2018-10-10 14:42:50,301 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_15.bpl [2018-10-10 14:42:50,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 14:42:50,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 14:42:50,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=3260, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 14:42:50,304 INFO L87 Difference]: Start difference. First operand 292 states and 299 transitions. Second operand 59 states. [2018-10-10 14:42:52,598 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-10-10 14:42:53,318 WARN L178 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-10-10 14:42:53,893 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2018-10-10 14:42:54,325 WARN L178 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-10-10 14:42:54,771 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 76 [2018-10-10 14:42:55,555 WARN L178 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2018-10-10 14:42:56,216 WARN L178 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 89 [2018-10-10 14:42:57,015 WARN L178 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 96 [2018-10-10 14:42:57,658 WARN L178 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 89 [2018-10-10 14:42:58,278 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2018-10-10 14:42:58,819 WARN L178 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2018-10-10 14:42:59,235 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-10-10 14:42:59,683 WARN L178 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-10-10 14:42:59,993 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2018-10-10 14:43:00,533 WARN L178 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2018-10-10 14:43:01,015 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-10-10 14:43:01,383 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-10-10 14:43:01,603 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2018-10-10 14:43:02,099 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-10-10 14:43:02,314 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-10-10 14:43:02,710 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2018-10-10 14:43:03,750 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-10-10 14:43:04,258 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2018-10-10 14:43:05,301 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2018-10-10 14:43:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:05,400 INFO L93 Difference]: Finished difference Result 400 states and 409 transitions. [2018-10-10 14:43:05,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 14:43:05,400 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 168 [2018-10-10 14:43:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:05,404 INFO L225 Difference]: With dead ends: 400 [2018-10-10 14:43:05,404 INFO L226 Difference]: Without dead ends: 400 [2018-10-10 14:43:05,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=900, Invalid=8606, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 14:43:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-10 14:43:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 303. [2018-10-10 14:43:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-10 14:43:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 310 transitions. [2018-10-10 14:43:05,414 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 310 transitions. Word has length 168 [2018-10-10 14:43:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:05,414 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 310 transitions. [2018-10-10 14:43:05,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 14:43:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 310 transitions. [2018-10-10 14:43:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-10 14:43:05,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:05,416 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,417 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:05,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:05,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1605670340, now seen corresponding path program 1 times [2018-10-10 14:43:05,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:05,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:05,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:05,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:06,528 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 14:43:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:07,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:07,865 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:07,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:07,978 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:07,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:07,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:07,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-10 14:43:07,995 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:07,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,010 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:08,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-10-10 14:43:08,104 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:08,104 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:08,105 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:43:08,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-10-10 14:43:08,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-10 14:43:08,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,128 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:08,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:18 [2018-10-10 14:43:08,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:43:08,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:08,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:43:08,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:29 [2018-10-10 14:43:08,557 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 28 treesize of output 25 [2018-10-10 14:43:08,563 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:08,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,605 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 38 treesize of output 35 [2018-10-10 14:43:08,609 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:08,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,642 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 24 treesize of output 21 [2018-10-10 14:43:08,644 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:08,645 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,650 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,675 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 34 treesize of output 31 [2018-10-10 14:43:08,677 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:08,678 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,688 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:43:08,710 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:67, output treesize:49 [2018-10-10 14:43:08,942 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 31 treesize of output 27 [2018-10-10 14:43:08,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-10-10 14:43:08,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,977 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 20 treesize of output 16 [2018-10-10 14:43:08,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-10-10 14:43:08,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:08,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:09,008 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 45 treesize of output 41 [2018-10-10 14:43:09,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-10-10 14:43:09,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:09,019 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:09,038 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 34 treesize of output 28 [2018-10-10 14:43:09,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 20 treesize of output 11 [2018-10-10 14:43:09,041 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:09,050 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:09,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:43:09,065 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:77, output treesize:29 [2018-10-10 14:43:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:11,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:11,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 60 [2018-10-10 14:43:11,024 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_16.bpl [2018-10-10 14:43:11,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 14:43:11,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 14:43:11,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=3511, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 14:43:11,027 INFO L87 Difference]: Start difference. First operand 303 states and 310 transitions. Second operand 61 states. [2018-10-10 14:43:13,476 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-10-10 14:43:13,888 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-10-10 14:43:14,492 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-10-10 14:43:14,905 WARN L178 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2018-10-10 14:43:15,458 WARN L178 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-10-10 14:43:16,296 WARN L178 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-10-10 14:43:17,003 WARN L178 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-10-10 14:43:17,696 WARN L178 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2018-10-10 14:43:18,312 WARN L178 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-10-10 14:43:19,091 WARN L178 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-10-10 14:43:19,716 WARN L178 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-10-10 14:43:20,120 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-10-10 14:43:20,437 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-10-10 14:43:20,772 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2018-10-10 14:43:21,281 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-10-10 14:43:21,808 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2018-10-10 14:43:22,174 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-10-10 14:43:23,040 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-10-10 14:43:23,358 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-10-10 14:43:23,832 WARN L178 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-10-10 14:43:24,248 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2018-10-10 14:43:24,460 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-10-10 14:43:24,878 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2018-10-10 14:43:25,254 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-10-10 14:43:25,534 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-10-10 14:43:25,954 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-10-10 14:43:26,300 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-10-10 14:43:26,726 WARN L178 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-10-10 14:43:27,070 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-10-10 14:43:27,536 WARN L178 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2018-10-10 14:43:28,145 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-10 14:43:28,910 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-10-10 14:43:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:28,953 INFO L93 Difference]: Finished difference Result 419 states and 426 transitions. [2018-10-10 14:43:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 14:43:28,953 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 184 [2018-10-10 14:43:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:28,956 INFO L225 Difference]: With dead ends: 419 [2018-10-10 14:43:28,957 INFO L226 Difference]: Without dead ends: 419 [2018-10-10 14:43:28,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2315 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=851, Invalid=10705, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 14:43:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-10 14:43:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2018-10-10 14:43:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-10 14:43:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 329 transitions. [2018-10-10 14:43:28,966 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 329 transitions. Word has length 184 [2018-10-10 14:43:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:28,966 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 329 transitions. [2018-10-10 14:43:28,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 14:43:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 329 transitions. [2018-10-10 14:43:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-10 14:43:28,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:28,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,968 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:28,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1139476110, now seen corresponding path program 1 times [2018-10-10 14:43:28,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:28,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:28,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:29,841 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2018-10-10 14:43:33,867 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:43:33,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:33,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2018-10-10 14:43:33,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 14:43:33,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 14:43:33,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:43:33,869 INFO L87 Difference]: Start difference. First operand 321 states and 329 transitions. Second operand 39 states. [2018-10-10 14:43:35,018 WARN L178 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-10-10 14:43:36,338 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-10-10 14:43:36,697 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-10-10 14:43:36,854 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-10-10 14:43:38,262 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-10-10 14:43:38,636 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-10-10 14:43:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:39,886 INFO L93 Difference]: Finished difference Result 320 states and 328 transitions. [2018-10-10 14:43:39,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 14:43:39,887 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 186 [2018-10-10 14:43:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:39,889 INFO L225 Difference]: With dead ends: 320 [2018-10-10 14:43:39,889 INFO L226 Difference]: Without dead ends: 280 [2018-10-10 14:43:39,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=475, Invalid=5225, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 14:43:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-10 14:43:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2018-10-10 14:43:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-10 14:43:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 284 transitions. [2018-10-10 14:43:39,895 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 284 transitions. Word has length 186 [2018-10-10 14:43:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:39,896 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 284 transitions. [2018-10-10 14:43:39,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 14:43:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 284 transitions. [2018-10-10 14:43:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-10 14:43:39,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:39,897 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,898 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:39,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:39,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1668186958, now seen corresponding path program 2 times [2018-10-10 14:43:39,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:39,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:39,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:39,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:39,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:42,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:42,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:42,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:43:42,415 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:43:42,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:43:42,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:42,440 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:42,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:42,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:42,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:43:42,649 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:42,650 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:42,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-10-10 14:43:42,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:42,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:42,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-10-10 14:43:42,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:42,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:42,818 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:42,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-10-10 14:43:43,210 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:43:43,212 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:43,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:43,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:43,230 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:43,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-10-10 14:43:44,540 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-10 14:43:44,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:44,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:44,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:44,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-10 14:43:44,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:44,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:44,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-10-10 14:43:44,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-10-10 14:43:44,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:44,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:44,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:40 [2018-10-10 14:43:45,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:45,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:45,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:45,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:45,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:45,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-10-10 14:43:46,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 18 [2018-10-10 14:43:46,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-10-10 14:43:46,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:46,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:46,137 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:46,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2018-10-10 14:43:47,227 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:43:47,235 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:47,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:47,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:47,306 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:43:47,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:25 [2018-10-10 14:43:48,001 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:48,007 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:48,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:48,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:48,030 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:48,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-10-10 14:43:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:48,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:48,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 46] total 81 [2018-10-10 14:43:48,562 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:48,566 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:48,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:48 BoogieIcfgContainer [2018-10-10 14:43:48,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:48,568 INFO L168 Benchmark]: Toolchain (without parser) took 105296.41 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -411.7 MB). Peak memory consumption was 764.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:48,568 INFO L168 Benchmark]: CDTParser took 0.19 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:48,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.72 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:48,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.19 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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:48,569 INFO L168 Benchmark]: Boogie Preprocessor took 37.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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:48,570 INFO L168 Benchmark]: RCFGBuilder took 1307.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.8 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:48,570 INFO L168 Benchmark]: TraceAbstraction took 103375.66 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 424.7 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 321.7 MB). Peak memory consumption was 746.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:48,572 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.19 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 500.72 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.19 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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1307.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.8 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 103375.66 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 424.7 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 321.7 MB). Peak memory consumption was 746.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 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 558). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 247 locations, 21 error locations. TIMEOUT Result, 103.3s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 67.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3469 SDtfs, 21392 SDslu, 39938 SDs, 0 SdLazy, 20136 SolverSat, 474 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1165 GetRequests, 490 SyntacticMatches, 19 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8635 ImplicationChecksByTransitivity, 63.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 882 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 2577 NumberOfCodeBlocks, 2577 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2557 ConstructedInterpolants, 220 QuantifiedInterpolants, 5792266 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1139 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 0/82 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...