java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:36,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:36,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:36,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:36,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:36,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:36,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:36,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:36,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:36,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:36,686 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:36,687 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:36,688 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:36,689 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:36,690 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:36,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:36,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:36,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:36,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:36,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:36,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:36,699 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:36,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:36,702 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:36,702 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:36,703 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:36,704 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:36,705 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:36,706 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:36,707 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:36,707 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:36,708 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:36,708 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:36,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:36,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:36,710 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:36,711 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:41:36,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:36,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:36,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:36,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:36,727 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:36,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:36,728 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:36,728 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:36,728 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:36,728 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:36,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:36,729 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:36,729 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:36,729 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:36,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:36,730 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:36,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:36,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:36,730 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:36,730 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:36,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:36,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:36,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:36,731 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:36,731 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:36,732 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:41:36,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:36,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:36,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:36,800 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:36,800 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:36,801 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:37,108 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f5f2bac/a15f355104d0413789140a9bc163f71b/FLAGecb4bba82 [2018-10-10 14:41:37,386 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:37,390 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:37,408 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f5f2bac/a15f355104d0413789140a9bc163f71b/FLAGecb4bba82 [2018-10-10 14:41:37,421 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f5f2bac/a15f355104d0413789140a9bc163f71b [2018-10-10 14:41:37,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:37,432 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:37,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:37,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:37,437 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:37,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:37" (1/1) ... [2018-10-10 14:41:37,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22674479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37, skipping insertion in model container [2018-10-10 14:41:37,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:37" (1/1) ... [2018-10-10 14:41:37,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:37,500 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:37,766 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:37,780 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:37,866 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:37,923 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:37,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37 WrapperNode [2018-10-10 14:41:37,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:37,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:37,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:37,925 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:37,937 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:41:37" (1/1) ... [2018-10-10 14:41:37,960 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:41:37" (1/1) ... [2018-10-10 14:41:37,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:37,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:37,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:37,989 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:37,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37" (1/1) ... [2018-10-10 14:41:37,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37" (1/1) ... [2018-10-10 14:41:38,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37" (1/1) ... [2018-10-10 14:41:38,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37" (1/1) ... [2018-10-10 14:41:38,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37" (1/1) ... [2018-10-10 14:41:38,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37" (1/1) ... [2018-10-10 14:41:38,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37" (1/1) ... [2018-10-10 14:41:38,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:38,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:38,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:38,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:38,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37" (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:41:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:38,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:39,130 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:39,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:39 BoogieIcfgContainer [2018-10-10 14:41:39,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:39,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:39,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:39,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:39,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:37" (1/3) ... [2018-10-10 14:41:39,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55055635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:39, skipping insertion in model container [2018-10-10 14:41:39,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:37" (2/3) ... [2018-10-10 14:41:39,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55055635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:39, skipping insertion in model container [2018-10-10 14:41:39,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:39" (3/3) ... [2018-10-10 14:41:39,139 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:39,147 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:39,154 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-10-10 14:41:39,172 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-10-10 14:41:39,199 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:39,200 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:39,200 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:39,201 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:39,201 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:39,201 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:39,201 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:39,201 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:39,201 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2018-10-10 14:41:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:41:39,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:39,232 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:39,235 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:39,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:39,241 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:41:39,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:39,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:39,742 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:41:39,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:39,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:39,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:39,769 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 8 states. [2018-10-10 14:41:40,705 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:41:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:40,934 INFO L93 Difference]: Finished difference Result 205 states and 212 transitions. [2018-10-10 14:41:40,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:40,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:41:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:40,949 INFO L225 Difference]: With dead ends: 205 [2018-10-10 14:41:40,950 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 14:41:40,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 14:41:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-10-10 14:41:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-10 14:41:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 207 transitions. [2018-10-10 14:41:41,000 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 207 transitions. Word has length 46 [2018-10-10 14:41:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:41,001 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 207 transitions. [2018-10-10 14:41:41,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 207 transitions. [2018-10-10 14:41:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:41:41,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:41,003 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:41,004 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:41,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:41,004 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:41:41,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:41,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:41,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:41,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:41,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:41,449 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:41:41,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:41,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:41:41,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:41:41,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:41:41,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:41,453 INFO L87 Difference]: Start difference. First operand 200 states and 207 transitions. Second operand 13 states. [2018-10-10 14:41:42,412 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-10 14:41:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:42,766 INFO L93 Difference]: Finished difference Result 199 states and 206 transitions. [2018-10-10 14:41:42,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:41:42,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:41:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:42,775 INFO L225 Difference]: With dead ends: 199 [2018-10-10 14:41:42,776 INFO L226 Difference]: Without dead ends: 199 [2018-10-10 14:41:42,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:41:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-10 14:41:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-10-10 14:41:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 14:41:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 206 transitions. [2018-10-10 14:41:42,806 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 206 transitions. Word has length 47 [2018-10-10 14:41:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:42,807 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 206 transitions. [2018-10-10 14:41:42,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:41:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 206 transitions. [2018-10-10 14:41:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:41:42,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:42,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:42,811 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:42,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:41:42,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:42,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:42,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:42,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:42,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:42,915 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:41:42,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:42,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:41:42,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:41:42,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:41:42,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:41:42,917 INFO L87 Difference]: Start difference. First operand 199 states and 206 transitions. Second operand 6 states. [2018-10-10 14:41:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:43,284 INFO L93 Difference]: Finished difference Result 198 states and 205 transitions. [2018-10-10 14:41:43,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:41:43,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:41:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:43,287 INFO L225 Difference]: With dead ends: 198 [2018-10-10 14:41:43,287 INFO L226 Difference]: Without dead ends: 198 [2018-10-10 14:41:43,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-10 14:41:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-10-10 14:41:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 14:41:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 205 transitions. [2018-10-10 14:41:43,301 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 205 transitions. Word has length 56 [2018-10-10 14:41:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:43,301 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 205 transitions. [2018-10-10 14:41:43,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:41:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 205 transitions. [2018-10-10 14:41:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:41:43,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:43,305 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:43,305 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:43,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:41:43,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:43,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:43,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:43,679 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:41:43,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:43,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:43,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:43,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:43,681 INFO L87 Difference]: Start difference. First operand 198 states and 205 transitions. Second operand 9 states. [2018-10-10 14:41:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:44,067 INFO L93 Difference]: Finished difference Result 197 states and 204 transitions. [2018-10-10 14:41:44,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:44,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:41:44,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:44,069 INFO L225 Difference]: With dead ends: 197 [2018-10-10 14:41:44,069 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 14:41:44,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 14:41:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-10-10 14:41:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-10 14:41:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 204 transitions. [2018-10-10 14:41:44,082 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 204 transitions. Word has length 57 [2018-10-10 14:41:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:44,083 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 204 transitions. [2018-10-10 14:41:44,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 204 transitions. [2018-10-10 14:41:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-10 14:41:44,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:44,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:44,089 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:44,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:44,091 INFO L82 PathProgramCache]: Analyzing trace with hash 692453301, now seen corresponding path program 1 times [2018-10-10 14:41:44,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:44,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:44,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:44,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:44,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:44,232 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:41:44,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:44,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:44,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:44,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:44,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:44,234 INFO L87 Difference]: Start difference. First operand 197 states and 204 transitions. Second operand 8 states. [2018-10-10 14:41:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:44,714 INFO L93 Difference]: Finished difference Result 376 states and 395 transitions. [2018-10-10 14:41:44,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:41:44,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-10-10 14:41:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:44,720 INFO L225 Difference]: With dead ends: 376 [2018-10-10 14:41:44,720 INFO L226 Difference]: Without dead ends: 376 [2018-10-10 14:41:44,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:41:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-10 14:41:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 240. [2018-10-10 14:41:44,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-10 14:41:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 253 transitions. [2018-10-10 14:41:44,733 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 253 transitions. Word has length 81 [2018-10-10 14:41:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:44,734 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 253 transitions. [2018-10-10 14:41:44,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 253 transitions. [2018-10-10 14:41:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-10 14:41:44,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:44,736 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:44,737 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:44,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:44,737 INFO L82 PathProgramCache]: Analyzing trace with hash -8784008, now seen corresponding path program 1 times [2018-10-10 14:41:44,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:44,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:44,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:44,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:44,961 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:41:44,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:44,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:41:44,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:41:44,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:41:44,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:41:44,962 INFO L87 Difference]: Start difference. First operand 240 states and 253 transitions. Second operand 11 states. [2018-10-10 14:41:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:45,735 INFO L93 Difference]: Finished difference Result 394 states and 408 transitions. [2018-10-10 14:41:45,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:41:45,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-10-10 14:41:45,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:45,738 INFO L225 Difference]: With dead ends: 394 [2018-10-10 14:41:45,739 INFO L226 Difference]: Without dead ends: 394 [2018-10-10 14:41:45,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:41:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-10 14:41:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 242. [2018-10-10 14:41:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-10 14:41:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 254 transitions. [2018-10-10 14:41:45,747 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 254 transitions. Word has length 82 [2018-10-10 14:41:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:45,747 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 254 transitions. [2018-10-10 14:41:45,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:41:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 254 transitions. [2018-10-10 14:41:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-10 14:41:45,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:45,750 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:45,751 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:45,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:45,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1120595557, now seen corresponding path program 1 times [2018-10-10 14:41:45,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:45,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:45,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:45,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:45,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:45,994 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:41:45,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:45,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:45,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:45,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:45,996 INFO L87 Difference]: Start difference. First operand 242 states and 254 transitions. Second operand 8 states. [2018-10-10 14:41:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:46,401 INFO L93 Difference]: Finished difference Result 377 states and 396 transitions. [2018-10-10 14:41:46,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:41:46,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2018-10-10 14:41:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:46,403 INFO L225 Difference]: With dead ends: 377 [2018-10-10 14:41:46,404 INFO L226 Difference]: Without dead ends: 377 [2018-10-10 14:41:46,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-10 14:41:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 253. [2018-10-10 14:41:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-10 14:41:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 264 transitions. [2018-10-10 14:41:46,412 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 264 transitions. Word has length 91 [2018-10-10 14:41:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:46,413 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 264 transitions. [2018-10-10 14:41:46,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 264 transitions. [2018-10-10 14:41:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-10 14:41:46,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:46,415 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:46,416 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:46,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash -378723746, now seen corresponding path program 1 times [2018-10-10 14:41:46,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:46,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:46,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:46,637 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:41:46,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:46,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:41:46,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:41:46,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:41:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:41:46,638 INFO L87 Difference]: Start difference. First operand 253 states and 264 transitions. Second operand 11 states. [2018-10-10 14:41:47,589 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-10 14:41:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:47,625 INFO L93 Difference]: Finished difference Result 411 states and 427 transitions. [2018-10-10 14:41:47,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:41:47,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2018-10-10 14:41:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:47,629 INFO L225 Difference]: With dead ends: 411 [2018-10-10 14:41:47,629 INFO L226 Difference]: Without dead ends: 411 [2018-10-10 14:41:47,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:41:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-10 14:41:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 254. [2018-10-10 14:41:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-10 14:41:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 264 transitions. [2018-10-10 14:41:47,637 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 264 transitions. Word has length 92 [2018-10-10 14:41:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:47,637 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 264 transitions. [2018-10-10 14:41:47,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:41:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 264 transitions. [2018-10-10 14:41:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:41:47,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:47,639 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:47,640 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:47,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash 487510237, now seen corresponding path program 1 times [2018-10-10 14:41:47,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:47,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:47,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:47,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:47,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:48,375 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-10 14:41:48,538 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:41:48,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:48,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:41:48,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:41:48,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:41:48,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:41:48,540 INFO L87 Difference]: Start difference. First operand 254 states and 264 transitions. Second operand 16 states. [2018-10-10 14:41:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:49,720 INFO L93 Difference]: Finished difference Result 253 states and 263 transitions. [2018-10-10 14:41:49,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:41:49,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 95 [2018-10-10 14:41:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:49,723 INFO L225 Difference]: With dead ends: 253 [2018-10-10 14:41:49,723 INFO L226 Difference]: Without dead ends: 195 [2018-10-10 14:41:49,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:41:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-10 14:41:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-10-10 14:41:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 14:41:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 201 transitions. [2018-10-10 14:41:49,729 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 201 transitions. Word has length 95 [2018-10-10 14:41:49,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:49,730 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 201 transitions. [2018-10-10 14:41:49,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:41:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 201 transitions. [2018-10-10 14:41:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-10 14:41:49,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:49,731 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:49,732 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:49,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:49,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1962836725, now seen corresponding path program 1 times [2018-10-10 14:41:49,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:49,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:49,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:49,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:49,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:49,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:41:49,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:41:49,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:41:49,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:41:49,812 INFO L87 Difference]: Start difference. First operand 195 states and 201 transitions. Second operand 3 states. [2018-10-10 14:41:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:49,837 INFO L93 Difference]: Finished difference Result 197 states and 202 transitions. [2018-10-10 14:41:49,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:41:49,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-10 14:41:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:49,840 INFO L225 Difference]: With dead ends: 197 [2018-10-10 14:41:49,840 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 14:41:49,840 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:41:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 14:41:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-10 14:41:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-10 14:41:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 201 transitions. [2018-10-10 14:41:49,845 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 201 transitions. Word has length 102 [2018-10-10 14:41:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:49,846 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 201 transitions. [2018-10-10 14:41:49,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:41:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 201 transitions. [2018-10-10 14:41:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-10 14:41:49,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:49,847 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:49,848 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:49,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1620861660, now seen corresponding path program 1 times [2018-10-10 14:41:49,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:49,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:49,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:49,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:49,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:49,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:41:49,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:41:49,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:41:49,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:41:49,937 INFO L87 Difference]: Start difference. First operand 196 states and 201 transitions. Second operand 3 states. [2018-10-10 14:41:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:50,017 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-10-10 14:41:50,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:41:50,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-10-10 14:41:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:50,019 INFO L225 Difference]: With dead ends: 197 [2018-10-10 14:41:50,019 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 14:41:50,019 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:41:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 14:41:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-10 14:41:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-10 14:41:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2018-10-10 14:41:50,024 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 199 transitions. Word has length 123 [2018-10-10 14:41:50,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:50,024 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 199 transitions. [2018-10-10 14:41:50,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:41:50,025 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 199 transitions. [2018-10-10 14:41:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 14:41:50,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:50,026 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:50,027 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:50,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:50,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1611237203, now seen corresponding path program 1 times [2018-10-10 14:41:50,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:50,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:50,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:50,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-10 14:41:50,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:50,590 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:41:50,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:50,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-10 14:41:51,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:51,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-10-10 14:41:51,110 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_cstrncmp_#t~short5's outvar occurs in several conjuncts [(let ((.cse0 (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_4|))) (or (and .cse0 |v_ULTIMATE.start_cstrncmp_#t~short5_2|) (and (not .cse0) (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|))))] at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.addStatementsAndVariables(PathProgramDumper.java:634) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructTransitionStatements(PathProgramDumper.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.processTransition(PathProgramDumper.java:521) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructProcedureStatements(PathProgramDumper.java:489) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructNewImplementation(PathProgramDumper.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.(PathProgramDumper.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.doDump(PathProgramDumpController.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.reportPathProgram(PathProgramDumpController.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-10 14:41:51,114 INFO L168 Benchmark]: Toolchain (without parser) took 13682.88 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -510.8 MB). Peak memory consumption was 356.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:51,116 INFO L168 Benchmark]: CDTParser took 0.21 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:41:51,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:51,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.71 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:41:51,117 INFO L168 Benchmark]: Boogie Preprocessor took 108.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -814.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:51,118 INFO L168 Benchmark]: RCFGBuilder took 1033.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:51,119 INFO L168 Benchmark]: TraceAbstraction took 11981.47 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.9 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 227.6 MB). Peak memory consumption was 365.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:51,124 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.21 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 490.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.71 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 108.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -814.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1033.57 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11981.47 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.9 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 227.6 MB). Peak memory consumption was 365.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_cstrncmp_#t~short5's outvar occurs in several conjuncts [(let ((.cse0 (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_4|))) (or (and .cse0 |v_ULTIMATE.start_cstrncmp_#t~short5_2|) (and (not .cse0) (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|))))] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_cstrncmp_#t~short5's outvar occurs in several conjuncts [(let ((.cse0 (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_4|))) (or (and .cse0 |v_ULTIMATE.start_cstrncmp_#t~short5_2|) (and (not .cse0) (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|))))]: de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:107) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...