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/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:55,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:55,391 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:55,407 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:55,408 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:55,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:55,410 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:55,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:55,414 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:55,414 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:55,415 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:55,416 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:55,416 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:55,419 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:55,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:55,421 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:55,425 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:55,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:55,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:55,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:55,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:55,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:55,448 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:55,448 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:55,448 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:55,449 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:55,451 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:55,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:55,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:55,457 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:55,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:55,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:55,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:55,459 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:55,460 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:55,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:55,462 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,488 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:55,488 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:55,490 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:55,490 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:55,490 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:55,490 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:55,491 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:55,491 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:55,491 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:55,491 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:55,491 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:55,491 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:55,493 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:55,493 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:55,493 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:55,493 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:55,493 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:55,494 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:55,495 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:55,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:55,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:55,496 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:55,496 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:55,496 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:55,496 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:55,496 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,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:55,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:55,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:55,592 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:55,592 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:55,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:55,921 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a60243e/09d42644e96142deb379143f200de597/FLAG454a82b81 [2018-10-10 14:42:56,187 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:56,188 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:56,200 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a60243e/09d42644e96142deb379143f200de597/FLAG454a82b81 [2018-10-10 14:42:56,216 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1a60243e/09d42644e96142deb379143f200de597 [2018-10-10 14:42:56,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:56,229 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:56,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:56,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:56,234 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:56,235 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,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9c8bb9 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,238 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,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:56,292 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:56,506 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:56,517 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:56,580 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:56,643 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:56,643 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,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:56,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:56,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:56,645 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:56,655 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,681 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,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:56,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:56,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:56,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:56,725 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,725 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,730 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,730 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,737 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,743 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,745 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,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:56,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:56,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:56,748 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:56,749 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,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:56,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:57,915 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:57,916 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,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:57,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:57,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:57,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:57,921 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,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6a5c18 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,922 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,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6a5c18 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,923 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,925 INFO L112 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:57,936 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:57,947 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-10-10 14:42:57,964 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-10-10 14:42:57,991 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:57,992 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:57,992 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:57,992 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:57,992 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:57,993 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:57,993 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:57,993 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:57,993 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2018-10-10 14:42:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:42:58,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:58,029 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:58,032 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:58,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:42:58,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:58,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:58,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:58,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:58,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:58,585 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,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:58,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:58,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:58,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:58,613 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 8 states. [2018-10-10 14:42:59,320 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:42:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:59,665 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2018-10-10 14:42:59,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:59,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:42:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:59,681 INFO L225 Difference]: With dead ends: 193 [2018-10-10 14:42:59,682 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 14:42:59,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 14:42:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-10 14:42:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-10 14:42:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 193 transitions. [2018-10-10 14:42:59,734 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 193 transitions. Word has length 46 [2018-10-10 14:42:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:59,735 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 193 transitions. [2018-10-10 14:42:59,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 193 transitions. [2018-10-10 14:42:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:59,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:59,737 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:59,738 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:59,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:42:59,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:59,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:59,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:59,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:59,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:00,170 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,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:00,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:43:00,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:43:00,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:43:00,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:43:00,174 INFO L87 Difference]: Start difference. First operand 188 states and 193 transitions. Second operand 13 states. [2018-10-10 14:43:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:01,297 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2018-10-10 14:43:01,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:43:01,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:43:01,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:01,307 INFO L225 Difference]: With dead ends: 187 [2018-10-10 14:43:01,308 INFO L226 Difference]: Without dead ends: 187 [2018-10-10 14:43:01,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:43:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-10 14:43:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-10-10 14:43:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-10 14:43:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 192 transitions. [2018-10-10 14:43:01,336 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 192 transitions. Word has length 47 [2018-10-10 14:43:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:01,336 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 192 transitions. [2018-10-10 14:43:01,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:43:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 192 transitions. [2018-10-10 14:43:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:43:01,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:01,341 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,343 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:01,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:43:01,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:01,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:01,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:01,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:01,458 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,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:01,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:43:01,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:43:01,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:43:01,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:43:01,460 INFO L87 Difference]: Start difference. First operand 187 states and 192 transitions. Second operand 6 states. [2018-10-10 14:43:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:01,678 INFO L93 Difference]: Finished difference Result 186 states and 191 transitions. [2018-10-10 14:43:01,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:43:01,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:43:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:01,682 INFO L225 Difference]: With dead ends: 186 [2018-10-10 14:43:01,682 INFO L226 Difference]: Without dead ends: 186 [2018-10-10 14:43:01,683 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,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-10 14:43:01,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-10-10 14:43:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 14:43:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 191 transitions. [2018-10-10 14:43:01,694 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 191 transitions. Word has length 56 [2018-10-10 14:43:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:01,695 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 191 transitions. [2018-10-10 14:43:01,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:43:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 191 transitions. [2018-10-10 14:43:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:43:01,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:01,697 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,698 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:01,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:43:01,698 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:01,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:01,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:01,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:02,015 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,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:02,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:43:02,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:43:02,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:43:02,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:43:02,017 INFO L87 Difference]: Start difference. First operand 186 states and 191 transitions. Second operand 9 states. [2018-10-10 14:43:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:02,643 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-10-10 14:43:02,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:43:02,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:43:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:02,646 INFO L225 Difference]: With dead ends: 185 [2018-10-10 14:43:02,646 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 14:43:02,647 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:43:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 14:43:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-10-10 14:43:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-10 14:43:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 190 transitions. [2018-10-10 14:43:02,657 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 190 transitions. Word has length 57 [2018-10-10 14:43:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:02,658 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 190 transitions. [2018-10-10 14:43:02,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:43:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2018-10-10 14:43:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 14:43:02,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:02,661 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:02,662 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:02,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash -240091348, now seen corresponding path program 1 times [2018-10-10 14:43:02,662 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:02,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:02,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:02,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:02,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:02,827 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,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:02,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:43:02,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:43:02,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:43:02,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:43:02,830 INFO L87 Difference]: Start difference. First operand 185 states and 190 transitions. Second operand 9 states. [2018-10-10 14:43:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:03,373 INFO L93 Difference]: Finished difference Result 285 states and 294 transitions. [2018-10-10 14:43:03,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:43:03,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-10-10 14:43:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:03,377 INFO L225 Difference]: With dead ends: 285 [2018-10-10 14:43:03,377 INFO L226 Difference]: Without dead ends: 285 [2018-10-10 14:43:03,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:43:03,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-10 14:43:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 189. [2018-10-10 14:43:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-10 14:43:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2018-10-10 14:43:03,388 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 73 [2018-10-10 14:43:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:03,388 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2018-10-10 14:43:03,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:43:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2018-10-10 14:43:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-10 14:43:03,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:03,390 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:03,391 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:03,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:03,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1147102930, now seen corresponding path program 1 times [2018-10-10 14:43:03,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:03,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:03,623 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,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:03,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:43:03,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:43:03,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:43:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:03,625 INFO L87 Difference]: Start difference. First operand 189 states and 194 transitions. Second operand 12 states. [2018-10-10 14:43:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:04,344 INFO L93 Difference]: Finished difference Result 320 states and 327 transitions. [2018-10-10 14:43:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:43:04,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2018-10-10 14:43:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:04,346 INFO L225 Difference]: With dead ends: 320 [2018-10-10 14:43:04,346 INFO L226 Difference]: Without dead ends: 320 [2018-10-10 14:43:04,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:43:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-10 14:43:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 190. [2018-10-10 14:43:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-10 14:43:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 195 transitions. [2018-10-10 14:43:04,354 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 195 transitions. Word has length 74 [2018-10-10 14:43:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:04,355 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 195 transitions. [2018-10-10 14:43:04,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:43:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 195 transitions. [2018-10-10 14:43:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-10 14:43:04,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:04,357 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] [2018-10-10 14:43:04,358 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:04,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1009550949, now seen corresponding path program 1 times [2018-10-10 14:43:04,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:04,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:04,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:04,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:04,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:04,512 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,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:04,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:43:04,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:43:04,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:43:04,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:43:04,514 INFO L87 Difference]: Start difference. First operand 190 states and 195 transitions. Second operand 9 states. [2018-10-10 14:43:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:05,015 INFO L93 Difference]: Finished difference Result 285 states and 294 transitions. [2018-10-10 14:43:05,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:43:05,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-10-10 14:43:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:05,018 INFO L225 Difference]: With dead ends: 285 [2018-10-10 14:43:05,018 INFO L226 Difference]: Without dead ends: 285 [2018-10-10 14:43:05,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:43:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-10 14:43:05,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 232. [2018-10-10 14:43:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-10 14:43:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 243 transitions. [2018-10-10 14:43:05,026 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 243 transitions. Word has length 88 [2018-10-10 14:43:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:05,026 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 243 transitions. [2018-10-10 14:43:05,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:43:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 243 transitions. [2018-10-10 14:43:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 14:43:05,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:05,029 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] [2018-10-10 14:43:05,029 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:05,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1231308195, now seen corresponding path program 1 times [2018-10-10 14:43:05,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:05,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:05,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:05,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:05,362 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,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:05,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:43:05,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:43:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:43:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:05,364 INFO L87 Difference]: Start difference. First operand 232 states and 243 transitions. Second operand 12 states. [2018-10-10 14:43:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:06,474 INFO L93 Difference]: Finished difference Result 335 states and 343 transitions. [2018-10-10 14:43:06,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:43:06,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2018-10-10 14:43:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:06,476 INFO L225 Difference]: With dead ends: 335 [2018-10-10 14:43:06,477 INFO L226 Difference]: Without dead ends: 335 [2018-10-10 14:43:06,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:43:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-10 14:43:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 233. [2018-10-10 14:43:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-10 14:43:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 242 transitions. [2018-10-10 14:43:06,483 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 242 transitions. Word has length 89 [2018-10-10 14:43:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:06,483 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 242 transitions. [2018-10-10 14:43:06,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:43:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 242 transitions. [2018-10-10 14:43:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 14:43:06,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:06,485 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] [2018-10-10 14:43:06,486 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:06,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:06,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1497205221, now seen corresponding path program 1 times [2018-10-10 14:43:06,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:06,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:06,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:06,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:06,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,113 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:43:07,894 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-10-10 14:43:08,037 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,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:08,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:43:08,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:43:08,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:43:08,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:43:08,038 INFO L87 Difference]: Start difference. First operand 233 states and 242 transitions. Second operand 16 states. [2018-10-10 14:43:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:09,045 INFO L93 Difference]: Finished difference Result 232 states and 241 transitions. [2018-10-10 14:43:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:43:09,047 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-10-10 14:43:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:09,049 INFO L225 Difference]: With dead ends: 232 [2018-10-10 14:43:09,049 INFO L226 Difference]: Without dead ends: 208 [2018-10-10 14:43:09,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:43:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-10 14:43:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-10-10 14:43:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-10 14:43:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 216 transitions. [2018-10-10 14:43:09,055 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 216 transitions. Word has length 103 [2018-10-10 14:43:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:09,055 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 216 transitions. [2018-10-10 14:43:09,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:43:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 216 transitions. [2018-10-10 14:43:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-10 14:43:09,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:09,057 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] [2018-10-10 14:43:09,058 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:09,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1247037912, now seen corresponding path program 1 times [2018-10-10 14:43:09,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:09,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:09,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:09,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:09,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:09,238 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:09,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:09,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:43:09,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:43:09,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:43:09,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:43:09,240 INFO L87 Difference]: Start difference. First operand 208 states and 216 transitions. Second operand 10 states. [2018-10-10 14:43:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:09,718 INFO L93 Difference]: Finished difference Result 369 states and 381 transitions. [2018-10-10 14:43:09,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:43:09,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2018-10-10 14:43:09,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:09,721 INFO L225 Difference]: With dead ends: 369 [2018-10-10 14:43:09,722 INFO L226 Difference]: Without dead ends: 369 [2018-10-10 14:43:09,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:43:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-10 14:43:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 244. [2018-10-10 14:43:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-10 14:43:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 253 transitions. [2018-10-10 14:43:09,729 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 253 transitions. Word has length 110 [2018-10-10 14:43:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:09,729 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 253 transitions. [2018-10-10 14:43:09,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:43:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 253 transitions. [2018-10-10 14:43:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 14:43:09,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:09,731 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] [2018-10-10 14:43:09,731 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:09,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash -3469428, now seen corresponding path program 1 times [2018-10-10 14:43:09,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:09,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:09,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:10,781 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:10,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:10,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:43:10,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:43:10,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:43:10,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:43:10,782 INFO L87 Difference]: Start difference. First operand 244 states and 253 transitions. Second operand 14 states. [2018-10-10 14:43:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:11,677 INFO L93 Difference]: Finished difference Result 388 states and 401 transitions. [2018-10-10 14:43:11,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:43:11,679 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 111 [2018-10-10 14:43:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:11,682 INFO L225 Difference]: With dead ends: 388 [2018-10-10 14:43:11,682 INFO L226 Difference]: Without dead ends: 388 [2018-10-10 14:43:11,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=229, Invalid=583, Unknown=0, NotChecked=0, Total=812 [2018-10-10 14:43:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-10 14:43:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 245. [2018-10-10 14:43:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-10 14:43:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 254 transitions. [2018-10-10 14:43:11,688 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 254 transitions. Word has length 111 [2018-10-10 14:43:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:11,689 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 254 transitions. [2018-10-10 14:43:11,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:43:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 254 transitions. [2018-10-10 14:43:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-10 14:43:11,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:11,690 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] [2018-10-10 14:43:11,691 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:11,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1022420622, now seen corresponding path program 1 times [2018-10-10 14:43:11,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:11,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:11,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:11,768 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:11,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:11,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:43:11,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:11,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:11,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:11,769 INFO L87 Difference]: Start difference. First operand 245 states and 254 transitions. Second operand 3 states. [2018-10-10 14:43:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:11,849 INFO L93 Difference]: Finished difference Result 247 states and 256 transitions. [2018-10-10 14:43:11,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:11,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-10-10 14:43:11,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:11,851 INFO L225 Difference]: With dead ends: 247 [2018-10-10 14:43:11,852 INFO L226 Difference]: Without dead ends: 247 [2018-10-10 14:43:11,852 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:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-10 14:43:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-10-10 14:43:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-10 14:43:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 256 transitions. [2018-10-10 14:43:11,857 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 256 transitions. Word has length 112 [2018-10-10 14:43:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:11,857 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 256 transitions. [2018-10-10 14:43:11,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 256 transitions. [2018-10-10 14:43:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 14:43:11,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:11,859 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] [2018-10-10 14:43:11,859 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:11,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:11,860 INFO L82 PathProgramCache]: Analyzing trace with hash 903141474, now seen corresponding path program 1 times [2018-10-10 14:43:11,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:11,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:11,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:11,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:11,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:12,038 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:12,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:12,038 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:12,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:12,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:12,309 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:12,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:12,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-10-10 14:43:12,382 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_substring_#t~short6's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_substring_#t~mem3_3|))) (or (and (not .cse0) |v_ULTIMATE.start_substring_#t~short6_2|) (and .cse0 (not |v_ULTIMATE.start_substring_#t~short6_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:12,387 INFO L168 Benchmark]: Toolchain (without parser) took 16159.42 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 872.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -264.4 MB). Peak memory consumption was 608.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:12,388 INFO L168 Benchmark]: CDTParser took 0.21 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:12,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:12,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.29 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:12,390 INFO L168 Benchmark]: Boogie Preprocessor took 33.88 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:12,391 INFO L168 Benchmark]: RCFGBuilder took 1168.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -763.2 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:12,392 INFO L168 Benchmark]: TraceAbstraction took 14469.35 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 136.3 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 475.1 MB). Peak memory consumption was 611.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:12,396 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 414.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.29 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 33.88 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 1168.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -763.2 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14469.35 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 136.3 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 475.1 MB). Peak memory consumption was 611.4 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_substring_#t~short6's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_substring_#t~mem3_3|))) (or (and (not .cse0) |v_ULTIMATE.start_substring_#t~short6_2|) (and .cse0 (not |v_ULTIMATE.start_substring_#t~short6_2|))))] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_substring_#t~short6's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_substring_#t~mem3_3|))) (or (and (not .cse0) |v_ULTIMATE.start_substring_#t~short6_2|) (and .cse0 (not |v_ULTIMATE.start_substring_#t~short6_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...