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/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:55,411 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:55,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:55,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:55,430 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:55,431 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:55,432 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:55,434 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:55,435 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:55,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:55,437 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:55,437 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:55,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:55,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:55,440 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:55,441 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:55,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:55,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:55,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:55,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:55,448 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:55,456 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:55,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:55,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:55,459 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:55,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:55,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:55,461 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:55,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:55,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:55,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:55,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:55,466 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:55,469 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:55,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:55,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:55,471 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:42:55,498 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:55,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:55,500 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:55,501 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:55,502 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:55,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:55,502 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:55,503 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:55,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:55,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:55,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:55,503 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:55,504 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:55,504 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:55,504 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:55,504 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:55,505 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:55,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:55,505 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:55,505 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:55,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:55,506 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:55,506 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:55,506 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:55,506 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:55,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:42:55,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:55,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:55,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:55,610 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:55,610 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:55,611 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:55,917 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d7664e0/b8451c6c1a294d6581a79f4ed99f371a/FLAG42588739c [2018-10-10 14:42:56,198 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:56,200 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:56,218 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d7664e0/b8451c6c1a294d6581a79f4ed99f371a/FLAG42588739c [2018-10-10 14:42:56,235 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d7664e0/b8451c6c1a294d6581a79f4ed99f371a [2018-10-10 14:42:56,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:56,247 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:56,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:56,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:56,252 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:56,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac9e519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56, skipping insertion in model container [2018-10-10 14:42:56,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:56,309 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:56,523 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:56,534 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:56,589 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:56,645 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:56,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56 WrapperNode [2018-10-10 14:42:56,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:56,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:56,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:56,647 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:56,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:56,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:56,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:56,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:56,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (1/1) ... [2018-10-10 14:42:56,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:56,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:56,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:56,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:56,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:56,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:57,827 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:57,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:57 BoogieIcfgContainer [2018-10-10 14:42:57,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:57,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:57,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:57,832 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:57,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:56" (1/3) ... [2018-10-10 14:42:57,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71098034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:57, skipping insertion in model container [2018-10-10 14:42:57,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:56" (2/3) ... [2018-10-10 14:42:57,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71098034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:57, skipping insertion in model container [2018-10-10 14:42:57,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:57" (3/3) ... [2018-10-10 14:42:57,836 INFO L112 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:57,846 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:57,855 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-10-10 14:42:57,873 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-10-10 14:42:57,901 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:57,902 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:57,902 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:57,902 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:57,902 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:57,903 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:57,903 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:57,903 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:57,903 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states. [2018-10-10 14:42:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:42:57,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:57,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:57,942 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:57,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:42:57,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:57,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:58,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:58,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:58,427 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-10 14:42:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:58,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:58,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:58,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:58,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:58,529 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 8 states. [2018-10-10 14:42:59,297 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:42:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:59,650 INFO L93 Difference]: Finished difference Result 188 states and 193 transitions. [2018-10-10 14:42:59,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:59,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:42:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:59,664 INFO L225 Difference]: With dead ends: 188 [2018-10-10 14:42:59,664 INFO L226 Difference]: Without dead ends: 183 [2018-10-10 14:42:59,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-10 14:42:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-10-10 14:42:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 14:42:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 188 transitions. [2018-10-10 14:42:59,717 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 188 transitions. Word has length 46 [2018-10-10 14:42:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:59,717 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 188 transitions. [2018-10-10 14:42:59,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 188 transitions. [2018-10-10 14:42:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:59,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:59,720 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:59,720 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:59,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:42:59,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:59,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:59,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:59,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:00,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:00,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:43:00,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:43:00,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:43:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:43:00,205 INFO L87 Difference]: Start difference. First operand 183 states and 188 transitions. Second operand 13 states. [2018-10-10 14:43:00,867 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-10 14:43:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:01,478 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions. [2018-10-10 14:43:01,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:43:01,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:43:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:01,482 INFO L225 Difference]: With dead ends: 182 [2018-10-10 14:43:01,483 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 14:43:01,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:43:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 14:43:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-10 14:43:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-10 14:43:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 187 transitions. [2018-10-10 14:43:01,499 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 187 transitions. Word has length 47 [2018-10-10 14:43:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:01,500 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 187 transitions. [2018-10-10 14:43:01,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:43:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 187 transitions. [2018-10-10 14:43:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:43:01,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:01,502 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:43:01,503 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:01,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:01,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:43:01,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:01,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:01,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:01,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:01,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:01,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:43:01,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:43:01,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:43:01,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:43:01,627 INFO L87 Difference]: Start difference. First operand 182 states and 187 transitions. Second operand 6 states. [2018-10-10 14:43:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:01,878 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2018-10-10 14:43:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:43:01,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:43:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:01,881 INFO L225 Difference]: With dead ends: 181 [2018-10-10 14:43:01,881 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 14:43:01,882 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:43:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 14:43:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-10-10 14:43:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 14:43:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 186 transitions. [2018-10-10 14:43:01,892 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 186 transitions. Word has length 56 [2018-10-10 14:43:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:01,893 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 186 transitions. [2018-10-10 14:43:01,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:43:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2018-10-10 14:43:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:43:01,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:01,895 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:43:01,896 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:01,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:01,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:43:01,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:01,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:01,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:01,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:02,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:02,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:43:02,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:43:02,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:43:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:43:02,228 INFO L87 Difference]: Start difference. First operand 181 states and 186 transitions. Second operand 9 states. [2018-10-10 14:43:02,654 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-10 14:43:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:02,784 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2018-10-10 14:43:02,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:43:02,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:43:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:02,787 INFO L225 Difference]: With dead ends: 180 [2018-10-10 14:43:02,787 INFO L226 Difference]: Without dead ends: 180 [2018-10-10 14:43:02,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:43:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-10 14:43:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-10-10 14:43:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 14:43:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 185 transitions. [2018-10-10 14:43:02,797 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 185 transitions. Word has length 57 [2018-10-10 14:43:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:02,798 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 185 transitions. [2018-10-10 14:43:02,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:43:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 185 transitions. [2018-10-10 14:43:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-10 14:43:02,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:02,807 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] [2018-10-10 14:43:02,807 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:02,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:02,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1144302544, now seen corresponding path program 1 times [2018-10-10 14:43:02,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:02,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:02,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:02,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:02,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:03,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:03,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:43:03,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:43:03,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:43:03,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:43:03,003 INFO L87 Difference]: Start difference. First operand 180 states and 185 transitions. Second operand 9 states. [2018-10-10 14:43:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:03,552 INFO L93 Difference]: Finished difference Result 276 states and 285 transitions. [2018-10-10 14:43:03,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:43:03,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-10-10 14:43:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:03,555 INFO L225 Difference]: With dead ends: 276 [2018-10-10 14:43:03,556 INFO L226 Difference]: Without dead ends: 276 [2018-10-10 14:43:03,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:43:03,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-10 14:43:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 234. [2018-10-10 14:43:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 14:43:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 248 transitions. [2018-10-10 14:43:03,569 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 248 transitions. Word has length 74 [2018-10-10 14:43:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:03,569 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 248 transitions. [2018-10-10 14:43:03,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:43:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 248 transitions. [2018-10-10 14:43:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 14:43:03,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:03,571 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] [2018-10-10 14:43:03,572 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:03,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1113640623, now seen corresponding path program 1 times [2018-10-10 14:43:03,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:03,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:03,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:03,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:03,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:04,093 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-10 14:43:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:04,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:04,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:43:04,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:43:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:43:04,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:04,354 INFO L87 Difference]: Start difference. First operand 234 states and 248 transitions. Second operand 12 states. [2018-10-10 14:43:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:05,117 INFO L93 Difference]: Finished difference Result 294 states and 303 transitions. [2018-10-10 14:43:05,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:43:05,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-10-10 14:43:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:05,121 INFO L225 Difference]: With dead ends: 294 [2018-10-10 14:43:05,122 INFO L226 Difference]: Without dead ends: 294 [2018-10-10 14:43:05,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:43:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-10 14:43:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 234. [2018-10-10 14:43:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 14:43:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 246 transitions. [2018-10-10 14:43:05,141 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 246 transitions. Word has length 75 [2018-10-10 14:43:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:05,142 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 246 transitions. [2018-10-10 14:43:05,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:43:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 246 transitions. [2018-10-10 14:43:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 14:43:05,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:05,144 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] [2018-10-10 14:43:05,145 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:05,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash -423364713, now seen corresponding path program 1 times [2018-10-10 14:43:05,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:05,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:05,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:05,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:43:05,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:43:05,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:43:05,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:43:05,289 INFO L87 Difference]: Start difference. First operand 234 states and 246 transitions. Second operand 9 states. [2018-10-10 14:43:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:05,871 INFO L93 Difference]: Finished difference Result 324 states and 340 transitions. [2018-10-10 14:43:05,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:43:05,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-10-10 14:43:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:05,875 INFO L225 Difference]: With dead ends: 324 [2018-10-10 14:43:05,875 INFO L226 Difference]: Without dead ends: 324 [2018-10-10 14:43:05,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:43:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-10 14:43:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 281. [2018-10-10 14:43:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-10 14:43:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 296 transitions. [2018-10-10 14:43:05,883 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 296 transitions. Word has length 86 [2018-10-10 14:43:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:05,884 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 296 transitions. [2018-10-10 14:43:05,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:43:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 296 transitions. [2018-10-10 14:43:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-10 14:43:05,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:05,886 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] [2018-10-10 14:43:05,887 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:05,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash -239404072, now seen corresponding path program 1 times [2018-10-10 14:43:05,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:05,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:06,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:06,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:43:06,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:43:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:43:06,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:06,151 INFO L87 Difference]: Start difference. First operand 281 states and 296 transitions. Second operand 12 states. [2018-10-10 14:43:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:07,153 INFO L93 Difference]: Finished difference Result 352 states and 368 transitions. [2018-10-10 14:43:07,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:43:07,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-10-10 14:43:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:07,156 INFO L225 Difference]: With dead ends: 352 [2018-10-10 14:43:07,156 INFO L226 Difference]: Without dead ends: 352 [2018-10-10 14:43:07,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:43:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-10 14:43:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 283. [2018-10-10 14:43:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 14:43:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 297 transitions. [2018-10-10 14:43:07,164 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 297 transitions. Word has length 87 [2018-10-10 14:43:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:07,164 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 297 transitions. [2018-10-10 14:43:07,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:43:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 297 transitions. [2018-10-10 14:43:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-10 14:43:07,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:07,166 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 14:43:07,167 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:07,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:07,167 INFO L82 PathProgramCache]: Analyzing trace with hash -769502534, now seen corresponding path program 1 times [2018-10-10 14:43:07,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:07,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:07,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:07,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:07,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:07,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:43:07,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:07,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:07,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:07,232 INFO L87 Difference]: Start difference. First operand 283 states and 297 transitions. Second operand 3 states. [2018-10-10 14:43:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:07,249 INFO L93 Difference]: Finished difference Result 286 states and 300 transitions. [2018-10-10 14:43:07,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:07,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-10-10 14:43:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:07,254 INFO L225 Difference]: With dead ends: 286 [2018-10-10 14:43:07,255 INFO L226 Difference]: Without dead ends: 286 [2018-10-10 14:43:07,255 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:43:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-10 14:43:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-10-10 14:43:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-10 14:43:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 299 transitions. [2018-10-10 14:43:07,262 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 299 transitions. Word has length 120 [2018-10-10 14:43:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:07,262 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 299 transitions. [2018-10-10 14:43:07,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 299 transitions. [2018-10-10 14:43:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-10 14:43:07,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:07,264 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:07,265 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:07,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1138171297, now seen corresponding path program 1 times [2018-10-10 14:43:07,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:07,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:07,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:07,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,932 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 12 [2018-10-10 14:43:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:08,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:08,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-10-10 14:43:08,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 14:43:08,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 14:43:08,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:43:08,609 INFO L87 Difference]: Start difference. First operand 285 states and 299 transitions. Second operand 21 states. [2018-10-10 14:43:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:10,207 INFO L93 Difference]: Finished difference Result 284 states and 298 transitions. [2018-10-10 14:43:10,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 14:43:10,209 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 120 [2018-10-10 14:43:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:10,212 INFO L225 Difference]: With dead ends: 284 [2018-10-10 14:43:10,212 INFO L226 Difference]: Without dead ends: 245 [2018-10-10 14:43:10,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 14:43:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-10 14:43:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-10-10 14:43:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-10 14:43:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 256 transitions. [2018-10-10 14:43:10,218 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 256 transitions. Word has length 120 [2018-10-10 14:43:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:10,218 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 256 transitions. [2018-10-10 14:43:10,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 14:43:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 256 transitions. [2018-10-10 14:43:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 14:43:10,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:10,220 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:10,221 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:10,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash -357657405, now seen corresponding path program 1 times [2018-10-10 14:43:10,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:10,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:10,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 14:43:10,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:10,406 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:43:10,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:10,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 14:43:10,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:10,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-10-10 14:43:10,807 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_subseq_#t~short4's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_subseq_#t~mem2_3|))) (or (and |v_ULTIMATE.start_subseq_#t~short4_2| (not .cse0)) (and .cse0 (not |v_ULTIMATE.start_subseq_#t~short4_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:509) 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:43:10,811 INFO L168 Benchmark]: Toolchain (without parser) took 14564.83 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 860.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -393.0 MB). Peak memory consumption was 467.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:10,812 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:10,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:10,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:10,816 INFO L168 Benchmark]: Boogie Preprocessor took 32.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:10,816 INFO L168 Benchmark]: RCFGBuilder took 1092.39 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -751.7 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:10,817 INFO L168 Benchmark]: TraceAbstraction took 12981.67 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 134.2 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 337.6 MB). Peak memory consumption was 471.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:10,830 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 398.08 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 55.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.08 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 1092.39 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -751.7 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12981.67 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 134.2 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 337.6 MB). Peak memory consumption was 471.8 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_subseq_#t~short4's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_subseq_#t~mem2_3|))) (or (and |v_ULTIMATE.start_subseq_#t~short4_2| (not .cse0)) (and .cse0 (not |v_ULTIMATE.start_subseq_#t~short4_2|))))] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_subseq_#t~short4's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_subseq_#t~mem2_3|))) (or (and |v_ULTIMATE.start_subseq_#t~short4_2| (not .cse0)) (and .cse0 (not |v_ULTIMATE.start_subseq_#t~short4_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...