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/diff-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:47,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:47,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:47,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:47,759 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:47,760 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:47,761 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:47,763 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:47,765 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:47,765 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:47,767 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:47,767 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:47,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:47,770 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:47,771 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:47,772 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:47,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:47,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:47,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:47,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:47,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:47,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:47,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:47,795 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:47,795 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:47,796 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:47,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:47,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:47,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:47,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:47,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:47,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:47,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:47,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:47,807 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:47,808 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:47,809 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:41:47,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:47,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:47,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:47,837 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:47,837 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:47,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:47,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:47,838 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:47,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:47,838 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:47,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:47,838 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:47,839 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:47,839 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:47,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:47,840 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:47,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:47,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:47,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:47,841 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:47,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:47,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:47,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:47,841 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:47,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:47,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:41:47,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:47,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:47,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:47,922 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:47,923 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:47,923 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:48,229 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e59a3002/af93d0b31aee4231a6ae14b6d8e7bb94/FLAGfc7fa2e05 [2018-10-10 14:41:48,522 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:48,523 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:48,538 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e59a3002/af93d0b31aee4231a6ae14b6d8e7bb94/FLAGfc7fa2e05 [2018-10-10 14:41:48,552 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e59a3002/af93d0b31aee4231a6ae14b6d8e7bb94 [2018-10-10 14:41:48,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:48,562 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:48,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:48,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:48,567 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:48,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:48" (1/1) ... [2018-10-10 14:41:48,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a72bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:48, skipping insertion in model container [2018-10-10 14:41:48,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:48" (1/1) ... [2018-10-10 14:41:48,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:48,639 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:48,880 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:48,890 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:48,944 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:49,002 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:49,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49 WrapperNode [2018-10-10 14:41:49,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:49,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:49,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:49,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:49,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (1/1) ... [2018-10-10 14:41:49,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (1/1) ... [2018-10-10 14:41:49,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:49,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:49,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:49,071 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:49,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (1/1) ... [2018-10-10 14:41:49,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (1/1) ... [2018-10-10 14:41:49,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (1/1) ... [2018-10-10 14:41:49,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (1/1) ... [2018-10-10 14:41:49,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (1/1) ... [2018-10-10 14:41:49,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (1/1) ... [2018-10-10 14:41:49,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (1/1) ... [2018-10-10 14:41:49,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:49,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:49,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:49,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:49,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:49,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:50,267 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:50,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:50 BoogieIcfgContainer [2018-10-10 14:41:50,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:50,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:50,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:50,272 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:50,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:48" (1/3) ... [2018-10-10 14:41:50,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f65853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:50, skipping insertion in model container [2018-10-10 14:41:50,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:49" (2/3) ... [2018-10-10 14:41:50,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f65853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:50, skipping insertion in model container [2018-10-10 14:41:50,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:50" (3/3) ... [2018-10-10 14:41:50,277 INFO L112 eAbstractionObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:50,286 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:50,295 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-10-10 14:41:50,312 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-10-10 14:41:50,341 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:50,342 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:50,342 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:50,342 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:50,342 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:50,342 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:50,343 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:50,343 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:50,343 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2018-10-10 14:41:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 14:41:50,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:50,377 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] [2018-10-10 14:41:50,380 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:50,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:50,387 INFO L82 PathProgramCache]: Analyzing trace with hash 406248657, now seen corresponding path program 1 times [2018-10-10 14:41:50,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:50,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:50,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:50,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:51,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:51,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:41:51,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:41:51,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:41:51,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:41:51,107 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 11 states. [2018-10-10 14:41:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:52,742 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2018-10-10 14:41:52,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:41:52,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-10-10 14:41:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:52,757 INFO L225 Difference]: With dead ends: 189 [2018-10-10 14:41:52,758 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 14:41:52,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:41:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 14:41:52,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 164. [2018-10-10 14:41:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-10 14:41:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 169 transitions. [2018-10-10 14:41:52,809 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 169 transitions. Word has length 77 [2018-10-10 14:41:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:52,811 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 169 transitions. [2018-10-10 14:41:52,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:41:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 169 transitions. [2018-10-10 14:41:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-10 14:41:52,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:52,815 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] [2018-10-10 14:41:52,816 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:52,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:52,817 INFO L82 PathProgramCache]: Analyzing trace with hash -291193383, now seen corresponding path program 1 times [2018-10-10 14:41:52,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:52,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:52,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:52,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:52,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:53,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:53,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-10-10 14:41:53,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:41:53,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:41:53,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:41:53,530 INFO L87 Difference]: Start difference. First operand 164 states and 169 transitions. Second operand 20 states. [2018-10-10 14:41:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:55,787 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2018-10-10 14:41:55,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 14:41:55,788 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2018-10-10 14:41:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:55,796 INFO L225 Difference]: With dead ends: 303 [2018-10-10 14:41:55,799 INFO L226 Difference]: Without dead ends: 303 [2018-10-10 14:41:55,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=388, Invalid=1418, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 14:41:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-10 14:41:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 204. [2018-10-10 14:41:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 14:41:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 215 transitions. [2018-10-10 14:41:55,819 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 215 transitions. Word has length 78 [2018-10-10 14:41:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:55,820 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 215 transitions. [2018-10-10 14:41:55,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:41:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 215 transitions. [2018-10-10 14:41:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-10 14:41:55,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:55,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:55,823 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:55,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:55,824 INFO L82 PathProgramCache]: Analyzing trace with hash 36645335, now seen corresponding path program 1 times [2018-10-10 14:41:55,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:55,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:55,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:55,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:56,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:56,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:41:56,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:41:56,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:41:56,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:41:56,067 INFO L87 Difference]: Start difference. First operand 204 states and 215 transitions. Second operand 10 states. [2018-10-10 14:41:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:56,642 INFO L93 Difference]: Finished difference Result 230 states and 245 transitions. [2018-10-10 14:41:56,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:41:56,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-10-10 14:41:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:56,646 INFO L225 Difference]: With dead ends: 230 [2018-10-10 14:41:56,646 INFO L226 Difference]: Without dead ends: 230 [2018-10-10 14:41:56,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:41:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-10 14:41:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 203. [2018-10-10 14:41:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-10 14:41:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 213 transitions. [2018-10-10 14:41:56,661 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 213 transitions. Word has length 87 [2018-10-10 14:41:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:56,662 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 213 transitions. [2018-10-10 14:41:56,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:41:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 213 transitions. [2018-10-10 14:41:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-10 14:41:56,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:56,664 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:56,665 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:56,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash 776868071, now seen corresponding path program 1 times [2018-10-10 14:41:56,666 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:56,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:56,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:56,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:56,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:56,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:56,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:41:56,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:41:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:41:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:41:56,751 INFO L87 Difference]: Start difference. First operand 203 states and 213 transitions. Second operand 3 states. [2018-10-10 14:41:56,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:56,768 INFO L93 Difference]: Finished difference Result 241 states and 253 transitions. [2018-10-10 14:41:56,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:41:56,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-10-10 14:41:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:56,773 INFO L225 Difference]: With dead ends: 241 [2018-10-10 14:41:56,773 INFO L226 Difference]: Without dead ends: 241 [2018-10-10 14:41:56,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:41:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-10 14:41:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 209. [2018-10-10 14:41:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-10 14:41:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 221 transitions. [2018-10-10 14:41:56,785 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 221 transitions. Word has length 88 [2018-10-10 14:41:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:56,786 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 221 transitions. [2018-10-10 14:41:56,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:41:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 221 transitions. [2018-10-10 14:41:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-10 14:41:56,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:56,788 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:41:56,789 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:56,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1136005535, now seen corresponding path program 1 times [2018-10-10 14:41:56,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:56,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:56,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:56,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:57,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:57,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:41:57,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:41:57,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:41:57,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:41:57,157 INFO L87 Difference]: Start difference. First operand 209 states and 221 transitions. Second operand 16 states. [2018-10-10 14:41:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:58,255 INFO L93 Difference]: Finished difference Result 369 states and 388 transitions. [2018-10-10 14:41:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:41:58,256 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2018-10-10 14:41:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:58,258 INFO L225 Difference]: With dead ends: 369 [2018-10-10 14:41:58,258 INFO L226 Difference]: Without dead ends: 369 [2018-10-10 14:41:58,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 14:41:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-10 14:41:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 265. [2018-10-10 14:41:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-10 14:41:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 284 transitions. [2018-10-10 14:41:58,270 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 284 transitions. Word has length 88 [2018-10-10 14:41:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:58,271 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 284 transitions. [2018-10-10 14:41:58,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:41:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 284 transitions. [2018-10-10 14:41:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 14:41:58,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:58,273 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:41:58,274 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:58,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1882717637, now seen corresponding path program 1 times [2018-10-10 14:41:58,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:58,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:58,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:58,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:58,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:58,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:58,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:58,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:58,369 INFO L87 Difference]: Start difference. First operand 265 states and 284 transitions. Second operand 8 states. [2018-10-10 14:41:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:58,821 INFO L93 Difference]: Finished difference Result 356 states and 384 transitions. [2018-10-10 14:41:58,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:41:58,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2018-10-10 14:41:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:58,823 INFO L225 Difference]: With dead ends: 356 [2018-10-10 14:41:58,824 INFO L226 Difference]: Without dead ends: 356 [2018-10-10 14:41:58,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-10 14:41:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 264. [2018-10-10 14:41:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-10 14:41:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 283 transitions. [2018-10-10 14:41:58,832 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 283 transitions. Word has length 89 [2018-10-10 14:41:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:58,832 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 283 transitions. [2018-10-10 14:41:58,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 283 transitions. [2018-10-10 14:41:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-10 14:41:58,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:58,834 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] [2018-10-10 14:41:58,835 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:58,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1765295202, now seen corresponding path program 1 times [2018-10-10 14:41:58,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:58,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:58,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:58,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:58,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:59,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:59,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:59,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:59,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:59,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:59,669 INFO L87 Difference]: Start difference. First operand 264 states and 283 transitions. Second operand 8 states. [2018-10-10 14:41:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:59,773 INFO L93 Difference]: Finished difference Result 368 states and 386 transitions. [2018-10-10 14:41:59,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:41:59,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-10-10 14:41:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:59,775 INFO L225 Difference]: With dead ends: 368 [2018-10-10 14:41:59,775 INFO L226 Difference]: Without dead ends: 368 [2018-10-10 14:41:59,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-10 14:41:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 264. [2018-10-10 14:41:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-10 14:41:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 281 transitions. [2018-10-10 14:41:59,782 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 281 transitions. Word has length 90 [2018-10-10 14:41:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:59,783 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 281 transitions. [2018-10-10 14:41:59,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 281 transitions. [2018-10-10 14:41:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 14:41:59,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:59,785 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] [2018-10-10 14:41:59,785 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:59,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:59,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1911233957, now seen corresponding path program 1 times [2018-10-10 14:41:59,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:59,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:59,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:59,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:59,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:00,116 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:00,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:00,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:00,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:42:00,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:42:00,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:42:00,117 INFO L87 Difference]: Start difference. First operand 264 states and 281 transitions. Second operand 7 states. [2018-10-10 14:42:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:00,222 INFO L93 Difference]: Finished difference Result 288 states and 303 transitions. [2018-10-10 14:42:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:42:00,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-10-10 14:42:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:00,226 INFO L225 Difference]: With dead ends: 288 [2018-10-10 14:42:00,226 INFO L226 Difference]: Without dead ends: 288 [2018-10-10 14:42:00,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-10 14:42:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 264. [2018-10-10 14:42:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-10 14:42:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 280 transitions. [2018-10-10 14:42:00,233 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 280 transitions. Word has length 94 [2018-10-10 14:42:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:00,234 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 280 transitions. [2018-10-10 14:42:00,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:42:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 280 transitions. [2018-10-10 14:42:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-10 14:42:00,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:00,237 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:00,237 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:00,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2114552069, now seen corresponding path program 1 times [2018-10-10 14:42:00,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:00,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:00,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:01,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:01,378 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:01,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:01,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:01,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:01,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:01,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:01,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-10 14:42:01,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:01,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:01,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:01,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-10-10 14:42:01,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:01,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:01,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:42:01,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-10-10 14:42:02,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-10 14:42:02,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:02,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-10-10 14:42:02,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:02,351 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:02,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:02,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-10 14:42:02,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-10-10 14:42:02,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-10 14:42:02,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:11 [2018-10-10 14:42:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:42:03,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:03,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 31 [2018-10-10 14:42:03,354 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/diff-alloca_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 14:42:03,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 14:42:03,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 14:42:03,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2018-10-10 14:42:03,370 INFO L87 Difference]: Start difference. First operand 264 states and 280 transitions. Second operand 32 states. [2018-10-10 14:42:04,756 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-10-10 14:42:06,055 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-10-10 14:42:06,210 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-10-10 14:42:06,485 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-10-10 14:42:06,657 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-10-10 14:42:06,830 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-10-10 14:42:07,056 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-10-10 14:42:07,371 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2018-10-10 14:42:07,787 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-10-10 14:42:07,954 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2018-10-10 14:42:08,346 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-10-10 14:42:08,596 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-10-10 14:42:08,762 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-10-10 14:42:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:09,033 INFO L93 Difference]: Finished difference Result 323 states and 337 transitions. [2018-10-10 14:42:09,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 14:42:09,034 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 114 [2018-10-10 14:42:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:09,037 INFO L225 Difference]: With dead ends: 323 [2018-10-10 14:42:09,037 INFO L226 Difference]: Without dead ends: 323 [2018-10-10 14:42:09,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 102 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=920, Invalid=3240, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 14:42:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-10 14:42:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 193. [2018-10-10 14:42:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-10 14:42:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 201 transitions. [2018-10-10 14:42:09,044 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 201 transitions. Word has length 114 [2018-10-10 14:42:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:09,044 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 201 transitions. [2018-10-10 14:42:09,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 14:42:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 201 transitions. [2018-10-10 14:42:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 14:42:09,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:09,046 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:09,047 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:09,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1576209230, now seen corresponding path program 1 times [2018-10-10 14:42:09,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:09,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:09,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:09,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:42:09,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 14:42:09,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 14:42:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:42:09,120 INFO L87 Difference]: Start difference. First operand 193 states and 201 transitions. Second operand 4 states. [2018-10-10 14:42:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:09,179 INFO L93 Difference]: Finished difference Result 225 states and 230 transitions. [2018-10-10 14:42:09,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:42:09,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-10-10 14:42:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:09,182 INFO L225 Difference]: With dead ends: 225 [2018-10-10 14:42:09,182 INFO L226 Difference]: Without dead ends: 225 [2018-10-10 14:42:09,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:42:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-10 14:42:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 181. [2018-10-10 14:42:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 14:42:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2018-10-10 14:42:09,186 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 116 [2018-10-10 14:42:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:09,186 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2018-10-10 14:42:09,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 14:42:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2018-10-10 14:42:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 14:42:09,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:09,188 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:09,188 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:09,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:09,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1092183308, now seen corresponding path program 1 times [2018-10-10 14:42:09,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:09,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:09,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:10,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:10,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:10,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:10,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:10,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:10,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-10 14:42:10,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:10,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-10-10 14:42:10,793 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:10,801 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:10,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:10,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-10-10 14:42:10,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-10 14:42:10,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:11 [2018-10-10 14:42:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:11,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:11,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 23 [2018-10-10 14:42:11,120 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/diff-alloca_true-valid-memsafety_true-termination.i_11.bpl [2018-10-10 14:42:11,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 14:42:11,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 14:42:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:42:11,122 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 24 states. [2018-10-10 14:42:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:13,055 INFO L93 Difference]: Finished difference Result 278 states and 284 transitions. [2018-10-10 14:42:13,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:42:13,055 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 116 [2018-10-10 14:42:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:13,058 INFO L225 Difference]: With dead ends: 278 [2018-10-10 14:42:13,058 INFO L226 Difference]: Without dead ends: 278 [2018-10-10 14:42:13,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 107 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=394, Invalid=1768, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 14:42:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-10 14:42:13,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 166. [2018-10-10 14:42:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-10 14:42:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2018-10-10 14:42:13,063 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 116 [2018-10-10 14:42:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:13,064 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2018-10-10 14:42:13,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 14:42:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2018-10-10 14:42:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-10 14:42:13,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:13,066 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,066 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:13,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash 133907379, now seen corresponding path program 1 times [2018-10-10 14:42:13,067 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:13,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:13,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:13,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:42:13,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:13,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:13,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:13,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:13,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:13,458 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand 12 states. [2018-10-10 14:42:14,463 WARN L178 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-10 14:42:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:14,703 INFO L93 Difference]: Finished difference Result 258 states and 264 transitions. [2018-10-10 14:42:14,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:14,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2018-10-10 14:42:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:14,706 INFO L225 Difference]: With dead ends: 258 [2018-10-10 14:42:14,706 INFO L226 Difference]: Without dead ends: 258 [2018-10-10 14:42:14,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:42:14,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-10 14:42:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 225. [2018-10-10 14:42:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-10 14:42:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 232 transitions. [2018-10-10 14:42:14,711 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 232 transitions. Word has length 118 [2018-10-10 14:42:14,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:14,711 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 232 transitions. [2018-10-10 14:42:14,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 232 transitions. [2018-10-10 14:42:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-10 14:42:14,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:14,713 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:14,713 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:14,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 643047293, now seen corresponding path program 1 times [2018-10-10 14:42:14,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:14,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:14,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:15,427 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:42:15,716 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2018-10-10 14:42:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:42:17,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:17,268 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:17,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:17,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:17,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:17,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-10-10 14:42:17,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:17,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:17,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:25 [2018-10-10 14:42:17,613 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:17,614 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:17,615 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:17,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-10-10 14:42:17,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:17,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:17,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2018-10-10 14:42:17,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:17,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 28 [2018-10-10 14:42:17,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:17,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:17,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:30 [2018-10-10 14:42:18,120 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:18,121 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:18,122 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:18,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-10-10 14:42:18,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:18,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:18,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:30 [2018-10-10 14:42:18,389 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:18,390 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:18,391 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:18,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-10-10 14:42:18,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:18,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:18,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:38 [2018-10-10 14:42:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:42:18,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:42:18,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [23] total 38 [2018-10-10 14:42:18,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 14:42:18,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 14:42:18,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1396, Unknown=2, NotChecked=0, Total=1482 [2018-10-10 14:42:18,826 INFO L87 Difference]: Start difference. First operand 225 states and 232 transitions. Second operand 39 states. [2018-10-10 14:42:20,977 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2018-10-10 14:42:21,572 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2018-10-10 14:42:21,895 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2018-10-10 14:42:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:23,511 INFO L93 Difference]: Finished difference Result 224 states and 231 transitions. [2018-10-10 14:42:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 14:42:23,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 130 [2018-10-10 14:42:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:23,513 INFO L225 Difference]: With dead ends: 224 [2018-10-10 14:42:23,513 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 14:42:23,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=324, Invalid=3964, Unknown=2, NotChecked=0, Total=4290 [2018-10-10 14:42:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 14:42:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-10-10 14:42:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 14:42:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 204 transitions. [2018-10-10 14:42:23,518 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 204 transitions. Word has length 130 [2018-10-10 14:42:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:23,518 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 204 transitions. [2018-10-10 14:42:23,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 14:42:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 204 transitions. [2018-10-10 14:42:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 14:42:23,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:23,520 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:23,520 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:23,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:23,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2060104326, now seen corresponding path program 1 times [2018-10-10 14:42:23,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:23,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:23,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:23,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:23,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:42:24,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:24,245 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:24,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:24,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:24,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:24,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:42:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:42:25,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:25,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-10-10 14:42:25,668 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/diff-alloca_true-valid-memsafety_true-termination.i_14.bpl [2018-10-10 14:42:25,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 14:42:25,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 14:42:25,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:42:25,670 INFO L87 Difference]: Start difference. First operand 198 states and 204 transitions. Second operand 27 states. [2018-10-10 14:42:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:28,001 INFO L93 Difference]: Finished difference Result 403 states and 415 transitions. [2018-10-10 14:42:28,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:28,002 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 180 [2018-10-10 14:42:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:28,005 INFO L225 Difference]: With dead ends: 403 [2018-10-10 14:42:28,005 INFO L226 Difference]: Without dead ends: 403 [2018-10-10 14:42:28,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 169 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=401, Invalid=1669, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 14:42:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-10 14:42:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 257. [2018-10-10 14:42:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-10 14:42:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 265 transitions. [2018-10-10 14:42:28,011 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 265 transitions. Word has length 180 [2018-10-10 14:42:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:28,012 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 265 transitions. [2018-10-10 14:42:28,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 14:42:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 265 transitions. [2018-10-10 14:42:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-10 14:42:28,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:28,014 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,014 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:28,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:28,014 INFO L82 PathProgramCache]: Analyzing trace with hash 785807912, now seen corresponding path program 1 times [2018-10-10 14:42:28,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:28,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:28,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:28,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-10 14:42:28,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:28,667 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:28,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:28,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:28,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:28,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:28,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:28,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:42:30,744 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 14:42:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 34 proven. 91 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-10 14:42:31,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:31,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-10-10 14:42:31,056 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl [2018-10-10 14:42:31,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 14:42:31,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 14:42:31,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:42:31,058 INFO L87 Difference]: Start difference. First operand 257 states and 265 transitions. Second operand 31 states. [2018-10-10 14:42:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:34,112 INFO L93 Difference]: Finished difference Result 464 states and 478 transitions. [2018-10-10 14:42:34,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 14:42:34,113 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 216 [2018-10-10 14:42:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:34,117 INFO L225 Difference]: With dead ends: 464 [2018-10-10 14:42:34,117 INFO L226 Difference]: Without dead ends: 464 [2018-10-10 14:42:34,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 203 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=527, Invalid=2335, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 14:42:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-10 14:42:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 266. [2018-10-10 14:42:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-10 14:42:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 274 transitions. [2018-10-10 14:42:34,124 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 274 transitions. Word has length 216 [2018-10-10 14:42:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:34,124 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 274 transitions. [2018-10-10 14:42:34,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 14:42:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 274 transitions. [2018-10-10 14:42:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-10 14:42:34,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:34,126 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:34,127 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:34,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash -948461031, now seen corresponding path program 2 times [2018-10-10 14:42:34,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:34,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:34,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 3 proven. 171 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-10 14:42:35,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:35,216 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:35,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:42:35,293 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:42:35,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:42:35,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:35,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:35,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:35,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:35,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:42:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-10 14:42:36,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:36,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-10-10 14:42:36,395 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:42:36,399 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:42:36,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:42:36 BoogieIcfgContainer [2018-10-10 14:42:36,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:42:36,400 INFO L168 Benchmark]: Toolchain (without parser) took 47838.60 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -920.2 MB). Peak memory consumption was 262.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:36,401 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:36,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:36,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.35 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:42:36,402 INFO L168 Benchmark]: Boogie Preprocessor took 67.73 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:42:36,402 INFO L168 Benchmark]: RCFGBuilder took 1133.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:36,403 INFO L168 Benchmark]: TraceAbstraction took 46130.36 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 429.9 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -158.8 MB). Peak memory consumption was 271.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:36,407 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 439.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.35 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 67.73 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 1133.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46130.36 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 429.9 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -158.8 MB). Peak memory consumption was 271.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 564). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 171 locations, 9 error locations. TIMEOUT Result, 46.0s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2788 SDtfs, 18669 SDslu, 17057 SDs, 0 SdLazy, 7403 SolverSat, 248 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1186 GetRequests, 726 SyntacticMatches, 29 SemanticMatches, 431 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 27.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 1167 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2417 ConstructedInterpolants, 331 QuantifiedInterpolants, 3938361 SizeOfPredicates, 127 NumberOfNonLiveVariables, 1474 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 76/456 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...