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/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:52:49,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:52:49,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:52:49,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:52:49,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:52:49,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:52:49,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:52:49,396 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:52:49,398 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:52:49,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:52:49,406 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:52:49,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:52:49,409 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:52:49,410 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:52:49,414 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:52:49,415 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:52:49,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:52:49,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:52:49,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:52:49,422 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:52:49,423 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:52:49,424 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:52:49,426 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:52:49,426 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:52:49,426 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:52:49,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:52:49,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:52:49,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:52:49,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:52:49,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:52:49,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:52:49,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:52:49,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:52:49,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:52:49,434 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:52:49,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:52:49,437 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:52:49,462 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:52:49,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:52:49,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:52:49,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:52:49,464 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:52:49,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:52:49,464 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:52:49,464 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:52:49,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:52:49,465 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:52:49,465 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:52:49,465 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:52:49,465 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:52:49,465 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:52:49,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:52:49,466 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:52:49,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:52:49,466 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:52:49,466 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:52:49,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:52:49,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:52:49,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:52:49,467 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:52:49,467 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:52:49,468 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:52:49,468 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:52:49,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:52:49,528 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:52:49,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:52:49,535 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:52:49,535 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:52:49,536 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-10-10 14:52:49,862 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/209cab34b/74661a6cb7b340129836e02012b29627/FLAGb80046896 [2018-10-10 14:52:50,037 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:52:50,037 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-10-10 14:52:50,045 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/209cab34b/74661a6cb7b340129836e02012b29627/FLAGb80046896 [2018-10-10 14:52:50,062 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/209cab34b/74661a6cb7b340129836e02012b29627 [2018-10-10 14:52:50,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:52:50,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:52:50,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:52:50,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:52:50,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:52:50,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:52:50" (1/1) ... [2018-10-10 14:52:50,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6496cce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50, skipping insertion in model container [2018-10-10 14:52:50,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:52:50" (1/1) ... [2018-10-10 14:52:50,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:52:50,117 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:52:50,333 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:52:50,345 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:52:50,369 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:52:50,389 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:52:50,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50 WrapperNode [2018-10-10 14:52:50,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:52:50,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:52:50,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:52:50,391 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:52:50,401 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:52:50" (1/1) ... [2018-10-10 14:52:50,410 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:52:50" (1/1) ... [2018-10-10 14:52:50,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:52:50,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:52:50,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:52:50,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:52:50,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50" (1/1) ... [2018-10-10 14:52:50,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50" (1/1) ... [2018-10-10 14:52:50,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50" (1/1) ... [2018-10-10 14:52:50,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50" (1/1) ... [2018-10-10 14:52:50,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50" (1/1) ... [2018-10-10 14:52:50,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50" (1/1) ... [2018-10-10 14:52:50,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50" (1/1) ... [2018-10-10 14:52:50,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:52:50,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:52:50,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:52:50,463 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:52:50,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50" (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:52:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:52:50,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:52:51,501 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:52:51,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:52:51 BoogieIcfgContainer [2018-10-10 14:52:51,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:52:51,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:52:51,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:52:51,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:52:51,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:52:50" (1/3) ... [2018-10-10 14:52:51,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ded93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:52:51, skipping insertion in model container [2018-10-10 14:52:51,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:50" (2/3) ... [2018-10-10 14:52:51,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ded93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:52:51, skipping insertion in model container [2018-10-10 14:52:51,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:52:51" (3/3) ... [2018-10-10 14:52:51,512 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-10-10 14:52:51,521 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:52:51,529 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-10-10 14:52:51,542 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-10-10 14:52:51,570 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:52:51,571 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:52:51,571 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:52:51,571 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:52:51,571 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:52:51,572 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:52:51,572 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:52:51,572 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:52:51,572 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:52:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-10-10 14:52:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 14:52:51,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:51,605 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] [2018-10-10 14:52:51,608 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:51,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2128082017, now seen corresponding path program 1 times [2018-10-10 14:52:51,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:51,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:51,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:51,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:51,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:51,761 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:52:51,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:51,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:52:51,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-10 14:52:51,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-10 14:52:51,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:52:51,788 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 2 states. [2018-10-10 14:52:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:51,812 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2018-10-10 14:52:51,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-10 14:52:51,814 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 41 [2018-10-10 14:52:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:51,827 INFO L225 Difference]: With dead ends: 144 [2018-10-10 14:52:51,828 INFO L226 Difference]: Without dead ends: 139 [2018-10-10 14:52:51,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:52:51,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-10 14:52:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-10 14:52:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-10 14:52:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2018-10-10 14:52:51,879 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 41 [2018-10-10 14:52:51,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:51,880 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2018-10-10 14:52:51,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-10 14:52:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2018-10-10 14:52:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-10 14:52:51,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:51,882 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] [2018-10-10 14:52:51,883 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:51,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:51,883 INFO L82 PathProgramCache]: Analyzing trace with hash -216081668, now seen corresponding path program 1 times [2018-10-10 14:52:51,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:51,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:51,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:51,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:51,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:52,004 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:52:52,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:52,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:52:52,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:52:52,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:52:52,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:52:52,007 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 3 states. [2018-10-10 14:52:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:52,294 INFO L93 Difference]: Finished difference Result 226 states and 230 transitions. [2018-10-10 14:52:52,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:52:52,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-10 14:52:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:52,297 INFO L225 Difference]: With dead ends: 226 [2018-10-10 14:52:52,298 INFO L226 Difference]: Without dead ends: 226 [2018-10-10 14:52:52,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:52:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-10 14:52:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 143. [2018-10-10 14:52:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 14:52:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2018-10-10 14:52:52,316 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 42 [2018-10-10 14:52:52,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:52,317 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2018-10-10 14:52:52,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:52:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2018-10-10 14:52:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 14:52:52,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:52,322 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] [2018-10-10 14:52:52,323 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:52,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:52,323 INFO L82 PathProgramCache]: Analyzing trace with hash 942852897, now seen corresponding path program 1 times [2018-10-10 14:52:52,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:52,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:52,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:52,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:52,598 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:52:52,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:52,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:52:52,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:52:52,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:52:52,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:52,600 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand 7 states. [2018-10-10 14:52:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:53,628 INFO L93 Difference]: Finished difference Result 475 states and 484 transitions. [2018-10-10 14:52:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:52:53,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-10-10 14:52:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:53,635 INFO L225 Difference]: With dead ends: 475 [2018-10-10 14:52:53,640 INFO L226 Difference]: Without dead ends: 475 [2018-10-10 14:52:53,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:52:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-10-10 14:52:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 157. [2018-10-10 14:52:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 14:52:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2018-10-10 14:52:53,679 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 48 [2018-10-10 14:52:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:53,680 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2018-10-10 14:52:53,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:52:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-10-10 14:52:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 14:52:53,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:53,684 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] [2018-10-10 14:52:53,684 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:53,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:53,686 INFO L82 PathProgramCache]: Analyzing trace with hash -555367937, now seen corresponding path program 1 times [2018-10-10 14:52:53,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:53,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:53,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:53,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:53,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:53,863 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:52:53,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:53,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:52:53,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:52:53,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:52:53,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:53,865 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 7 states. [2018-10-10 14:52:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:54,664 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2018-10-10 14:52:54,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:52:54,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-10-10 14:52:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:54,666 INFO L225 Difference]: With dead ends: 159 [2018-10-10 14:52:54,666 INFO L226 Difference]: Without dead ends: 159 [2018-10-10 14:52:54,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:52:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-10 14:52:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-10-10 14:52:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 14:52:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2018-10-10 14:52:54,675 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 51 [2018-10-10 14:52:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:54,676 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2018-10-10 14:52:54,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:52:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-10-10 14:52:54,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 14:52:54,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:54,678 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] [2018-10-10 14:52:54,679 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:54,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:54,679 INFO L82 PathProgramCache]: Analyzing trace with hash -36536764, now seen corresponding path program 1 times [2018-10-10 14:52:54,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:54,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:54,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:54,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:55,052 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:52:55,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:55,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:52:55,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:52:55,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:52:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:52:55,054 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 13 states. [2018-10-10 14:52:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:56,591 INFO L93 Difference]: Finished difference Result 364 states and 375 transitions. [2018-10-10 14:52:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:52:56,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-10-10 14:52:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:56,593 INFO L225 Difference]: With dead ends: 364 [2018-10-10 14:52:56,594 INFO L226 Difference]: Without dead ends: 364 [2018-10-10 14:52:56,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2018-10-10 14:52:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-10 14:52:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 175. [2018-10-10 14:52:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-10 14:52:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 181 transitions. [2018-10-10 14:52:56,610 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 181 transitions. Word has length 52 [2018-10-10 14:52:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:56,611 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 181 transitions. [2018-10-10 14:52:56,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:52:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 181 transitions. [2018-10-10 14:52:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-10 14:52:56,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:56,615 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 14:52:56,616 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:56,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2108114642, now seen corresponding path program 1 times [2018-10-10 14:52:56,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:56,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:56,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:56,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:56,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:56,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:52:56,729 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:52:56,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:56,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:52:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:56,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:52:56,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-10 14:52:56,874 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_6.bpl [2018-10-10 14:52:56,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:52:56,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:52:56,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:52:56,880 INFO L87 Difference]: Start difference. First operand 175 states and 181 transitions. Second operand 5 states. [2018-10-10 14:52:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:57,167 INFO L93 Difference]: Finished difference Result 403 states and 415 transitions. [2018-10-10 14:52:57,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:52:57,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-10-10 14:52:57,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:57,171 INFO L225 Difference]: With dead ends: 403 [2018-10-10 14:52:57,171 INFO L226 Difference]: Without dead ends: 403 [2018-10-10 14:52:57,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-10 14:52:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 211. [2018-10-10 14:52:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 14:52:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 220 transitions. [2018-10-10 14:52:57,180 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 220 transitions. Word has length 66 [2018-10-10 14:52:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:57,181 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 220 transitions. [2018-10-10 14:52:57,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:52:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 220 transitions. [2018-10-10 14:52:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 14:52:57,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:57,185 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,186 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:57,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:57,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1281359089, now seen corresponding path program 1 times [2018-10-10 14:52:57,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:57,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:57,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:57,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:57,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:52:57,383 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:52:57,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:57,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:52:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:57,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:52:57,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-10 14:52:57,638 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_7.bpl [2018-10-10 14:52:57,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:52:57,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:52:57,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:52:57,640 INFO L87 Difference]: Start difference. First operand 211 states and 220 transitions. Second operand 14 states. [2018-10-10 14:52:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:58,056 INFO L93 Difference]: Finished difference Result 365 states and 372 transitions. [2018-10-10 14:52:58,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:52:58,057 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-10-10 14:52:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:58,059 INFO L225 Difference]: With dead ends: 365 [2018-10-10 14:52:58,059 INFO L226 Difference]: Without dead ends: 365 [2018-10-10 14:52:58,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:52:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-10 14:52:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 211. [2018-10-10 14:52:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 14:52:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 219 transitions. [2018-10-10 14:52:58,067 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 219 transitions. Word has length 73 [2018-10-10 14:52:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:58,067 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 219 transitions. [2018-10-10 14:52:58,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:52:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 219 transitions. [2018-10-10 14:52:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 14:52:58,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:58,070 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-10-10 14:52:58,070 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:58,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash -572483517, now seen corresponding path program 2 times [2018-10-10 14:52:58,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:58,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:58,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:58,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:52:58,257 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:52:58,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:52:58,301 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:52:58,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:52:58,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:52:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:58,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:52:58,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-10-10 14:52:58,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 14:52:58,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 14:52:58,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:52:58,556 INFO L87 Difference]: Start difference. First operand 211 states and 219 transitions. Second operand 18 states. [2018-10-10 14:52:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:59,070 INFO L93 Difference]: Finished difference Result 359 states and 367 transitions. [2018-10-10 14:52:59,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:52:59,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-10-10 14:52:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:59,074 INFO L225 Difference]: With dead ends: 359 [2018-10-10 14:52:59,074 INFO L226 Difference]: Without dead ends: 359 [2018-10-10 14:52:59,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:52:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-10 14:52:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 210. [2018-10-10 14:52:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 14:52:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 216 transitions. [2018-10-10 14:52:59,081 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 216 transitions. Word has length 84 [2018-10-10 14:52:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:59,082 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 216 transitions. [2018-10-10 14:52:59,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 14:52:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 216 transitions. [2018-10-10 14:52:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-10 14:52:59,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:59,087 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-10 14:52:59,090 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:59,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:59,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1792958590, now seen corresponding path program 2 times [2018-10-10 14:52:59,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:59,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:59,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:59,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:52:59,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-10 14:52:59,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:59,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:52:59,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:52:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:52:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:59,401 INFO L87 Difference]: Start difference. First operand 210 states and 216 transitions. Second operand 7 states. [2018-10-10 14:52:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:59,679 INFO L93 Difference]: Finished difference Result 216 states and 222 transitions. [2018-10-10 14:52:59,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:52:59,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-10-10 14:52:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:59,681 INFO L225 Difference]: With dead ends: 216 [2018-10-10 14:52:59,681 INFO L226 Difference]: Without dead ends: 216 [2018-10-10 14:52:59,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:52:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-10 14:52:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 209. [2018-10-10 14:52:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-10 14:52:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 215 transitions. [2018-10-10 14:52:59,690 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 215 transitions. Word has length 91 [2018-10-10 14:52:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:59,691 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 215 transitions. [2018-10-10 14:52:59,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:52:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 215 transitions. [2018-10-10 14:52:59,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-10 14:52:59,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:59,692 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-10 14:52:59,693 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:59,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:59,708 INFO L82 PathProgramCache]: Analyzing trace with hash -252858432, now seen corresponding path program 1 times [2018-10-10 14:52:59,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:59,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:59,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:59,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:52:59,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-10 14:53:00,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:00,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:53:00,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:53:00,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:53:00,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:53:00,128 INFO L87 Difference]: Start difference. First operand 209 states and 215 transitions. Second operand 13 states. [2018-10-10 14:53:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:00,789 INFO L93 Difference]: Finished difference Result 251 states and 258 transitions. [2018-10-10 14:53:00,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:53:00,790 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2018-10-10 14:53:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:00,791 INFO L225 Difference]: With dead ends: 251 [2018-10-10 14:53:00,791 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 14:53:00,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:53:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 14:53:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 218. [2018-10-10 14:53:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-10 14:53:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 224 transitions. [2018-10-10 14:53:00,798 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 224 transitions. Word has length 92 [2018-10-10 14:53:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:00,798 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 224 transitions. [2018-10-10 14:53:00,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:53:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 224 transitions. [2018-10-10 14:53:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 14:53:00,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:00,800 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-10 14:53:00,800 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:00,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:00,801 INFO L82 PathProgramCache]: Analyzing trace with hash 457809070, now seen corresponding path program 1 times [2018-10-10 14:53:00,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:00,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:00,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-10 14:53:00,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:00,890 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:53:00,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:00,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-10 14:53:01,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:01,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-10 14:53:01,238 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl [2018-10-10 14:53:01,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:53:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:53:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:53:01,240 INFO L87 Difference]: Start difference. First operand 218 states and 224 transitions. Second operand 7 states. [2018-10-10 14:53:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:01,384 INFO L93 Difference]: Finished difference Result 331 states and 341 transitions. [2018-10-10 14:53:01,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:53:01,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-10-10 14:53:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:01,386 INFO L225 Difference]: With dead ends: 331 [2018-10-10 14:53:01,386 INFO L226 Difference]: Without dead ends: 331 [2018-10-10 14:53:01,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:53:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-10 14:53:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 229. [2018-10-10 14:53:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-10 14:53:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 235 transitions. [2018-10-10 14:53:01,392 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 235 transitions. Word has length 109 [2018-10-10 14:53:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:01,392 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 235 transitions. [2018-10-10 14:53:01,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:53:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 235 transitions. [2018-10-10 14:53:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 14:53:01,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:01,394 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:01,394 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:01,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1799637366, now seen corresponding path program 1 times [2018-10-10 14:53:01,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:01,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:01,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:01,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:01,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-10 14:53:02,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:02,439 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:02,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:02,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:02,521 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:53:02,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:02,534 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:53:02,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:53:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-10 14:53:02,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:02,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-10-10 14:53:02,693 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl [2018-10-10 14:53:02,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:53:02,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:53:02,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:53:02,695 INFO L87 Difference]: Start difference. First operand 229 states and 235 transitions. Second operand 11 states. [2018-10-10 14:53:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:03,439 INFO L93 Difference]: Finished difference Result 381 states and 391 transitions. [2018-10-10 14:53:03,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:53:03,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 119 [2018-10-10 14:53:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:03,443 INFO L225 Difference]: With dead ends: 381 [2018-10-10 14:53:03,443 INFO L226 Difference]: Without dead ends: 381 [2018-10-10 14:53:03,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:53:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-10 14:53:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 229. [2018-10-10 14:53:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-10 14:53:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 234 transitions. [2018-10-10 14:53:03,449 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 234 transitions. Word has length 119 [2018-10-10 14:53:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:03,449 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 234 transitions. [2018-10-10 14:53:03,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:53:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 234 transitions. [2018-10-10 14:53:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-10 14:53:03,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:03,451 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:53:03,451 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:03,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:03,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1184564944, now seen corresponding path program 1 times [2018-10-10 14:53:03,451 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:03,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:03,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:03,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:03,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-10 14:53:03,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:03,619 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:03,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:03,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-10 14:53:03,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:03,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-10-10 14:53:03,888 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl [2018-10-10 14:53:03,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:53:03,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:53:03,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:53:03,890 INFO L87 Difference]: Start difference. First operand 229 states and 234 transitions. Second operand 11 states. [2018-10-10 14:53:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:04,244 INFO L93 Difference]: Finished difference Result 269 states and 272 transitions. [2018-10-10 14:53:04,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:53:04,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2018-10-10 14:53:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:04,246 INFO L225 Difference]: With dead ends: 269 [2018-10-10 14:53:04,246 INFO L226 Difference]: Without dead ends: 269 [2018-10-10 14:53:04,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:53:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-10 14:53:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 229. [2018-10-10 14:53:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-10 14:53:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2018-10-10 14:53:04,251 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 123 [2018-10-10 14:53:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:04,252 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2018-10-10 14:53:04,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:53:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2018-10-10 14:53:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 14:53:04,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:04,253 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-10 14:53:04,254 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:04,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:04,254 INFO L82 PathProgramCache]: Analyzing trace with hash -766780377, now seen corresponding path program 2 times [2018-10-10 14:53:04,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:04,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:04,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:04,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:04,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-10 14:53:04,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:04,902 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:04,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:53:04,941 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:53:04,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:53:04,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:04,958 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:53:04,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:04,971 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:53:04,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:53:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-10 14:53:05,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:05,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 17 [2018-10-10 14:53:05,280 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:53:05,285 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:53:05,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:53:05 BoogieIcfgContainer [2018-10-10 14:53:05,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:53:05,286 INFO L168 Benchmark]: Toolchain (without parser) took 15212.73 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 878.2 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -266.2 MB). Peak memory consumption was 611.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:05,288 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:53:05,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.63 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:53:05,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:53:05,289 INFO L168 Benchmark]: Boogie Preprocessor took 29.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:53:05,290 INFO L168 Benchmark]: RCFGBuilder took 1039.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:05,291 INFO L168 Benchmark]: TraceAbstraction took 13781.77 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.8 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 499.0 MB). Peak memory consumption was 623.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:05,295 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 315.63 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. * Boogie Procedure Inliner took 41.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1039.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13781.77 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.8 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 499.0 MB). Peak memory consumption was 623.8 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 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 8 error locations. TIMEOUT Result, 13.7s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2025 SDtfs, 8092 SDslu, 6818 SDs, 0 SdLazy, 1850 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 747 GetRequests, 567 SyntacticMatches, 6 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 1422 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1565 NumberOfCodeBlocks, 1565 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1546 ConstructedInterpolants, 0 QuantifiedInterpolants, 601277 SizeOfPredicates, 36 NumberOfNonLiveVariables, 996 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 235/344 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...