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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 11:25:02,000 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 11:25:02,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 11:25:02,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 11:25:02,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 11:25:02,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 11:25:02,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 11:25:02,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 11:25:02,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 11:25:02,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 11:25:02,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 11:25:02,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 11:25:02,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 11:25:02,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 11:25:02,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 11:25:02,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 11:25:02,046 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 11:25:02,048 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 11:25:02,050 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 11:25:02,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 11:25:02,052 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 11:25:02,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 11:25:02,056 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 11:25:02,056 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 11:25:02,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 11:25:02,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 11:25:02,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 11:25:02,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 11:25:02,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 11:25:02,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 11:25:02,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 11:25:02,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 11:25:02,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 11:25:02,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 11:25:02,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 11:25:02,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 11:25:02,064 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 11:25:02,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 11:25:02,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 11:25:02,086 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 11:25:02,086 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 11:25:02,086 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 11:25:02,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 11:25:02,087 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 11:25:02,087 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 11:25:02,087 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 11:25:02,087 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 11:25:02,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 11:25:02,088 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 11:25:02,090 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 11:25:02,090 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 11:25:02,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 11:25:02,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 11:25:02,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 11:25:02,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 11:25:02,091 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 11:25:02,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 11:25:02,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 11:25:02,092 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 11:25:02,092 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 11:25:02,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 11:25:02,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 11:25:02,092 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 [2018-10-10 11:25:02,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 11:25:02,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 11:25:02,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 11:25:02,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 11:25:02,180 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 11:25:02,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-10-10 11:25:02,501 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d60fc2d0/3430a92d79cb460d95714b2e85cbb1a0/FLAGdf4f2dce0 [2018-10-10 11:25:02,677 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 11:25:02,678 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-10-10 11:25:02,684 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d60fc2d0/3430a92d79cb460d95714b2e85cbb1a0/FLAGdf4f2dce0 [2018-10-10 11:25:02,699 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d60fc2d0/3430a92d79cb460d95714b2e85cbb1a0 [2018-10-10 11:25:02,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 11:25:02,712 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 11:25:02,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 11:25:02,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 11:25:02,717 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 11:25:02,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:02" (1/1) ... [2018-10-10 11:25:02,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257bee7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:02, skipping insertion in model container [2018-10-10 11:25:02,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:02" (1/1) ... [2018-10-10 11:25:02,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 11:25:02,754 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 11:25:02,967 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 11:25:02,981 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 11:25:03,004 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 11:25:03,029 INFO L193 MainTranslator]: Completed translation [2018-10-10 11:25:03,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03 WrapperNode [2018-10-10 11:25:03,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 11:25:03,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 11:25:03,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 11:25:03,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 11:25:03,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (1/1) ... [2018-10-10 11:25:03,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (1/1) ... [2018-10-10 11:25:03,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 11:25:03,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 11:25:03,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 11:25:03,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 11:25:03,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (1/1) ... [2018-10-10 11:25:03,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (1/1) ... [2018-10-10 11:25:03,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (1/1) ... [2018-10-10 11:25:03,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (1/1) ... [2018-10-10 11:25:03,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (1/1) ... [2018-10-10 11:25:03,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (1/1) ... [2018-10-10 11:25:03,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (1/1) ... [2018-10-10 11:25:03,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 11:25:03,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 11:25:03,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 11:25:03,104 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 11:25:03,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (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 11:25:03,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 11:25:03,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 11:25:03,756 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 11:25:03,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:03 BoogieIcfgContainer [2018-10-10 11:25:03,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 11:25:03,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 11:25:03,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 11:25:03,761 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 11:25:03,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:25:02" (1/3) ... [2018-10-10 11:25:03,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247891cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:03, skipping insertion in model container [2018-10-10 11:25:03,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:03" (2/3) ... [2018-10-10 11:25:03,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247891cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:03, skipping insertion in model container [2018-10-10 11:25:03,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:03" (3/3) ... [2018-10-10 11:25:03,765 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-10-10 11:25:03,775 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 11:25:03,783 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-10-10 11:25:03,800 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-10-10 11:25:03,829 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 11:25:03,830 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 11:25:03,830 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 11:25:03,830 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 11:25:03,830 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 11:25:03,830 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 11:25:03,831 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 11:25:03,831 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 11:25:03,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 11:25:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-10-10 11:25:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-10 11:25:03,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:03,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:03,859 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:03,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1805952520, now seen corresponding path program 1 times [2018-10-10 11:25:03,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:03,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:03,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:03,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:03,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:04,038 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 11:25:04,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:04,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 11:25:04,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:25:04,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:25:04,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:04,061 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2018-10-10 11:25:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:04,279 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-10-10 11:25:04,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:25:04,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-10 11:25:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:04,296 INFO L225 Difference]: With dead ends: 67 [2018-10-10 11:25:04,296 INFO L226 Difference]: Without dead ends: 63 [2018-10-10 11:25:04,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:25:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-10 11:25:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2018-10-10 11:25:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-10 11:25:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-10-10 11:25:04,359 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 7 [2018-10-10 11:25:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:04,360 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-10-10 11:25:04,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:25:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-10-10 11:25:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-10 11:25:04,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:04,361 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:04,364 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:04,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash 148998123, now seen corresponding path program 1 times [2018-10-10 11:25:04,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:04,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:04,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:04,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:04,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:04,405 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 11:25:04,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:04,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:25:04,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:25:04,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:25:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:04,410 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2018-10-10 11:25:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:04,560 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-10-10 11:25:04,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:25:04,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-10 11:25:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:04,562 INFO L225 Difference]: With dead ends: 68 [2018-10-10 11:25:04,562 INFO L226 Difference]: Without dead ends: 68 [2018-10-10 11:25:04,563 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 11:25:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-10 11:25:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 40. [2018-10-10 11:25:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-10 11:25:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-10-10 11:25:04,570 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 8 [2018-10-10 11:25:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:04,571 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-10-10 11:25:04,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:25:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-10-10 11:25:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-10 11:25:04,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:04,572 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:04,572 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:04,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash 149953326, now seen corresponding path program 1 times [2018-10-10 11:25:04,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:04,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:04,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:04,704 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 11:25:04,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:04,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:04,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:04,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:04,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:04,706 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2018-10-10 11:25:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:05,066 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-10-10 11:25:05,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:25:05,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-10 11:25:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:05,069 INFO L225 Difference]: With dead ends: 54 [2018-10-10 11:25:05,069 INFO L226 Difference]: Without dead ends: 54 [2018-10-10 11:25:05,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-10 11:25:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-10-10 11:25:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-10 11:25:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-10-10 11:25:05,075 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 8 [2018-10-10 11:25:05,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:05,075 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-10-10 11:25:05,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-10-10 11:25:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-10 11:25:05,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:05,076 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:05,077 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:05,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash 353536214, now seen corresponding path program 1 times [2018-10-10 11:25:05,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:05,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:05,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:05,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:05,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:25:05,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:05,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:05,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:25:05,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:25:05,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:25:05,151 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-10-10 11:25:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:05,385 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-10-10 11:25:05,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 11:25:05,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-10-10 11:25:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:05,387 INFO L225 Difference]: With dead ends: 70 [2018-10-10 11:25:05,387 INFO L226 Difference]: Without dead ends: 70 [2018-10-10 11:25:05,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-10 11:25:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. [2018-10-10 11:25:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-10 11:25:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-10-10 11:25:05,394 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 9 [2018-10-10 11:25:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:05,395 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-10-10 11:25:05,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:25:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-10-10 11:25:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-10 11:25:05,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:05,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:05,396 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:05,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:05,397 INFO L82 PathProgramCache]: Analyzing trace with hash 353585866, now seen corresponding path program 1 times [2018-10-10 11:25:05,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:05,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:05,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:05,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:05,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:05,548 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 11:25:05,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:05,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:05,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:05,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:05,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:05,550 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-10-10 11:25:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:06,150 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-10-10 11:25:06,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:06,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-10-10 11:25:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:06,152 INFO L225 Difference]: With dead ends: 99 [2018-10-10 11:25:06,152 INFO L226 Difference]: Without dead ends: 99 [2018-10-10 11:25:06,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:25:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-10 11:25:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 43. [2018-10-10 11:25:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-10 11:25:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-10-10 11:25:06,160 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 9 [2018-10-10 11:25:06,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:06,161 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-10-10 11:25:06,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-10-10 11:25:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-10 11:25:06,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:06,162 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:06,163 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:06,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:06,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1905779327, now seen corresponding path program 1 times [2018-10-10 11:25:06,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:06,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:06,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:06,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:06,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:25:06,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:06,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:06,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:06,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:06,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:06,261 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-10-10 11:25:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:06,380 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-10-10 11:25:06,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:25:06,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-10 11:25:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:06,386 INFO L225 Difference]: With dead ends: 91 [2018-10-10 11:25:06,386 INFO L226 Difference]: Without dead ends: 91 [2018-10-10 11:25:06,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:25:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-10 11:25:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 49. [2018-10-10 11:25:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-10 11:25:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-10-10 11:25:06,398 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 13 [2018-10-10 11:25:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:06,399 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-10-10 11:25:06,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-10-10 11:25:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-10 11:25:06,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:06,400 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:06,401 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:06,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:06,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1797817229, now seen corresponding path program 1 times [2018-10-10 11:25:06,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:06,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:06,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:06,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:06,495 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 11:25:06,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:06,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:25:06,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:25:06,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:25:06,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:25:06,497 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 4 states. [2018-10-10 11:25:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:06,566 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-10-10 11:25:06,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 11:25:06,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-10 11:25:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:06,567 INFO L225 Difference]: With dead ends: 50 [2018-10-10 11:25:06,567 INFO L226 Difference]: Without dead ends: 50 [2018-10-10 11:25:06,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-10 11:25:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-10-10 11:25:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-10 11:25:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-10-10 11:25:06,572 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 15 [2018-10-10 11:25:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:06,573 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-10-10 11:25:06,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:25:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-10-10 11:25:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-10 11:25:06,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:06,574 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:06,574 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:06,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash -102240681, now seen corresponding path program 1 times [2018-10-10 11:25:06,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:06,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:06,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:06,701 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 11:25:06,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:06,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:25:06,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:25:06,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:25:06,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:25:06,703 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 4 states. [2018-10-10 11:25:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:06,821 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-10-10 11:25:06,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:25:06,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-10 11:25:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:06,822 INFO L225 Difference]: With dead ends: 85 [2018-10-10 11:25:06,823 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 11:25:06,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 11:25:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2018-10-10 11:25:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-10 11:25:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-10 11:25:06,831 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-10-10 11:25:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:06,832 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-10 11:25:06,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:25:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-10 11:25:06,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-10 11:25:06,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:06,836 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] [2018-10-10 11:25:06,837 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:06,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:06,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1071537352, now seen corresponding path program 1 times [2018-10-10 11:25:06,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:06,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:06,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:06,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:06,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 11:25:07,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:07,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:07,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:07,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:07,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:07,053 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-10-10 11:25:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:07,181 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-10-10 11:25:07,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:25:07,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-10 11:25:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:07,183 INFO L225 Difference]: With dead ends: 51 [2018-10-10 11:25:07,184 INFO L226 Difference]: Without dead ends: 51 [2018-10-10 11:25:07,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:25:07,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-10 11:25:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-10 11:25:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-10 11:25:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-10-10 11:25:07,190 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 23 [2018-10-10 11:25:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:07,191 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-10-10 11:25:07,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-10-10 11:25:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 11:25:07,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:07,192 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] [2018-10-10 11:25:07,194 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:07,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1142080543, now seen corresponding path program 1 times [2018-10-10 11:25:07,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:07,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:07,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:07,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:07,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:07,276 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 11:25:07,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 11:25:07,277 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 11:25:07,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:07,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:25:07,355 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 11:25:07,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 11:25:07,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-10 11:25:07,415 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: cannot bring into simultaneous update form, |v_ULTIMATE.start_main_~#mask~0.offset_1| has two outvars in equality [(not (= 0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_#length_1| (store |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| |v_ULTIMATE.start_#Ultimate.alloc_~size_1|)), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| (store |v_#valid_5| |v_ULTIMATE.start_main_~#b~0.base_1| 1)), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 32), (= |v_ULTIMATE.start_main_~#mask~0.offset_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1|), (= v_ULTIMATE.start_main_~i~1_2 0), (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#b~0.base_1|) 0), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= 0 (select |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (not (= |v_ULTIMATE.start_main_~#b~0.base_1| 0)), (= (store |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| 1) |v_#valid_3|), (= 0 |v_ULTIMATE.start_main_~#b~0.offset_1|), (= (store |v_#length_3| |v_ULTIMATE.start_main_~#b~0.base_1| 128) |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_5|), (= |v_ULTIMATE.start_main_~#mask~0.base_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)] at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.computeSubstitutionMapping(SimultaneousUpdate.java:174) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.extractUpdateRhs(SimultaneousUpdate.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:104) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.addStatementsAndVariables(PathProgramDumper.java:634) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructTransitionStatements(PathProgramDumper.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.processTransition(PathProgramDumper.java:521) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructProcedureStatements(PathProgramDumper.java:489) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructNewImplementation(PathProgramDumper.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.(PathProgramDumper.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.doDump(PathProgramDumpController.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.reportPathProgram(PathProgramDumpController.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-10 11:25:07,419 INFO L168 Benchmark]: Toolchain (without parser) took 4707.87 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.0 GB in the end (delta: -590.4 MB). Peak memory consumption was 162.5 MB. Max. memory is 7.1 GB. [2018-10-10 11:25:07,421 INFO L168 Benchmark]: CDTParser took 0.22 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 11:25:07,421 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.57 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-10-10 11:25:07,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.81 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 11:25:07,423 INFO L168 Benchmark]: Boogie Preprocessor took 31.15 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 11:25:07,423 INFO L168 Benchmark]: RCFGBuilder took 652.76 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: -775.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2018-10-10 11:25:07,424 INFO L168 Benchmark]: TraceAbstraction took 3660.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 171.4 MB). Peak memory consumption was 171.4 MB. Max. memory is 7.1 GB. [2018-10-10 11:25:07,430 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.22 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 317.57 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.81 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 31.15 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 652.76 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: -775.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3660.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 171.4 MB). Peak memory consumption was 171.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: cannot bring into simultaneous update form, |v_ULTIMATE.start_main_~#mask~0.offset_1| has two outvars in equality [(not (= 0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_#length_1| (store |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| |v_ULTIMATE.start_#Ultimate.alloc_~size_1|)), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| (store |v_#valid_5| |v_ULTIMATE.start_main_~#b~0.base_1| 1)), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 32), (= |v_ULTIMATE.start_main_~#mask~0.offset_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1|), (= v_ULTIMATE.start_main_~i~1_2 0), (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#b~0.base_1|) 0), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= 0 (select |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (not (= |v_ULTIMATE.start_main_~#b~0.base_1| 0)), (= (store |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| 1) |v_#valid_3|), (= 0 |v_ULTIMATE.start_main_~#b~0.offset_1|), (= (store |v_#length_3| |v_ULTIMATE.start_main_~#b~0.base_1| 128) |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_5|), (= |v_ULTIMATE.start_main_~#mask~0.base_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form, |v_ULTIMATE.start_main_~#mask~0.offset_1| has two outvars in equality [(not (= 0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_#length_1| (store |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| |v_ULTIMATE.start_#Ultimate.alloc_~size_1|)), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| (store |v_#valid_5| |v_ULTIMATE.start_main_~#b~0.base_1| 1)), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 32), (= |v_ULTIMATE.start_main_~#mask~0.offset_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1|), (= v_ULTIMATE.start_main_~i~1_2 0), (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#b~0.base_1|) 0), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= 0 (select |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (not (= |v_ULTIMATE.start_main_~#b~0.base_1| 0)), (= (store |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| 1) |v_#valid_3|), (= 0 |v_ULTIMATE.start_main_~#b~0.offset_1|), (= (store |v_#length_3| |v_ULTIMATE.start_main_~#b~0.base_1| 128) |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_5|), (= |v_ULTIMATE.start_main_~#mask~0.base_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)]: de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.computeSubstitutionMapping(SimultaneousUpdate.java:174) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...