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/ldv-memsafety-bitfields/test-bitfields-3.1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:54:07,620 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:54:07,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:54:07,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:54:07,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:54:07,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:54:07,640 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:54:07,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:54:07,651 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:54:07,652 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:54:07,653 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:54:07,653 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:54:07,657 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:54:07,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:54:07,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:54:07,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:54:07,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:54:07,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:54:07,664 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:54:07,666 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:54:07,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:54:07,668 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:54:07,670 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:54:07,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:54:07,671 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:54:07,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:54:07,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:54:07,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:54:07,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:54:07,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:54:07,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:54:07,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:54:07,677 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:54:07,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:54:07,680 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:54:07,681 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:54:07,681 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:54:07,705 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:54:07,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:54:07,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:54:07,707 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:54:07,707 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:54:07,707 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:54:07,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:54:07,708 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:54:07,708 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:54:07,708 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:54:07,708 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:54:07,709 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:54:07,709 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:54:07,709 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:54:07,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:54:07,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:54:07,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:54:07,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:54:07,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:54:07,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:54:07,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:54:07,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:54:07,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:54:07,711 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:54:07,711 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:54:07,711 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:54:07,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:54:07,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:54:07,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:54:07,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:54:07,791 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:54:07,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3.1_true-valid-memsafety_true-termination.i [2018-10-10 14:54:08,099 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f14bcf03/f2166c16255c444fae62a87029d23859/FLAG28c1f8456 [2018-10-10 14:54:08,309 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:54:08,310 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3.1_true-valid-memsafety_true-termination.i [2018-10-10 14:54:08,318 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f14bcf03/f2166c16255c444fae62a87029d23859/FLAG28c1f8456 [2018-10-10 14:54:08,334 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f14bcf03/f2166c16255c444fae62a87029d23859 [2018-10-10 14:54:08,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:54:08,347 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:54:08,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:54:08,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:54:08,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:54:08,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:54:08" (1/1) ... [2018-10-10 14:54:08,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592aa337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08, skipping insertion in model container [2018-10-10 14:54:08,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:54:08" (1/1) ... [2018-10-10 14:54:08,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:54:08,393 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:54:08,592 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:54:08,608 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:54:08,638 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:54:08,666 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:54:08,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08 WrapperNode [2018-10-10 14:54:08,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:54:08,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:54:08,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:54:08,667 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:54:08,677 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:54:08" (1/1) ... [2018-10-10 14:54:08,687 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:54:08" (1/1) ... [2018-10-10 14:54:08,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:54:08,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:54:08,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:54:08,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:54:08,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08" (1/1) ... [2018-10-10 14:54:08,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08" (1/1) ... [2018-10-10 14:54:08,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08" (1/1) ... [2018-10-10 14:54:08,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08" (1/1) ... [2018-10-10 14:54:08,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08" (1/1) ... [2018-10-10 14:54:08,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08" (1/1) ... [2018-10-10 14:54:08,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08" (1/1) ... [2018-10-10 14:54:08,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:54:08,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:54:08,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:54:08,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:54:08,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08" (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:54:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:54:08,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:54:10,169 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:54:10,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:54:10 BoogieIcfgContainer [2018-10-10 14:54:10,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:54:10,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:54:10,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:54:10,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:54:10,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:54:08" (1/3) ... [2018-10-10 14:54:10,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664ab13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:54:10, skipping insertion in model container [2018-10-10 14:54:10,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:08" (2/3) ... [2018-10-10 14:54:10,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664ab13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:54:10, skipping insertion in model container [2018-10-10 14:54:10,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:54:10" (3/3) ... [2018-10-10 14:54:10,179 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-3.1_true-valid-memsafety_true-termination.i [2018-10-10 14:54:10,190 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:54:10,199 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-10-10 14:54:10,217 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-10-10 14:54:10,246 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:54:10,247 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:54:10,247 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:54:10,247 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:54:10,247 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:54:10,247 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:54:10,248 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:54:10,248 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:54:10,248 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:54:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states. [2018-10-10 14:54:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 14:54:10,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:10,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:10,294 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:10,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash -368739409, now seen corresponding path program 1 times [2018-10-10 14:54:10,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:10,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:10,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:10,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:10,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:10,726 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:54:10,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:10,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:54:10,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:54:10,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:54:10,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:54:10,756 INFO L87 Difference]: Start difference. First operand 285 states. Second operand 6 states. [2018-10-10 14:54:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:12,443 INFO L93 Difference]: Finished difference Result 400 states and 411 transitions. [2018-10-10 14:54:12,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:54:12,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-10-10 14:54:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:12,464 INFO L225 Difference]: With dead ends: 400 [2018-10-10 14:54:12,465 INFO L226 Difference]: Without dead ends: 395 [2018-10-10 14:54:12,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:54:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-10 14:54:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 355. [2018-10-10 14:54:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-10 14:54:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 382 transitions. [2018-10-10 14:54:12,533 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 382 transitions. Word has length 97 [2018-10-10 14:54:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:12,534 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 382 transitions. [2018-10-10 14:54:12,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:54:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 382 transitions. [2018-10-10 14:54:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-10 14:54:12,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:12,539 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:12,540 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:12,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:12,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1453980339, now seen corresponding path program 1 times [2018-10-10 14:54:12,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:12,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:12,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:12,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:12,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:12,858 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:54:12,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:12,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:54:12,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:54:12,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:54:12,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:12,862 INFO L87 Difference]: Start difference. First operand 355 states and 382 transitions. Second operand 7 states. [2018-10-10 14:54:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:13,489 INFO L93 Difference]: Finished difference Result 394 states and 405 transitions. [2018-10-10 14:54:13,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:54:13,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-10-10 14:54:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:13,499 INFO L225 Difference]: With dead ends: 394 [2018-10-10 14:54:13,499 INFO L226 Difference]: Without dead ends: 394 [2018-10-10 14:54:13,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-10 14:54:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 354. [2018-10-10 14:54:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-10 14:54:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 381 transitions. [2018-10-10 14:54:13,521 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 381 transitions. Word has length 98 [2018-10-10 14:54:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:13,521 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 381 transitions. [2018-10-10 14:54:13,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:54:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 381 transitions. [2018-10-10 14:54:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:54:13,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:13,524 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:13,525 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:13,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2123717681, now seen corresponding path program 1 times [2018-10-10 14:54:13,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:13,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:13,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:13,782 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:54:13,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:13,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:54:13,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:54:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:54:13,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:54:13,784 INFO L87 Difference]: Start difference. First operand 354 states and 381 transitions. Second operand 8 states. [2018-10-10 14:54:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:14,231 INFO L93 Difference]: Finished difference Result 346 states and 367 transitions. [2018-10-10 14:54:14,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:54:14,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-10-10 14:54:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:14,234 INFO L225 Difference]: With dead ends: 346 [2018-10-10 14:54:14,234 INFO L226 Difference]: Without dead ends: 346 [2018-10-10 14:54:14,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-10 14:54:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-10-10 14:54:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-10 14:54:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 367 transitions. [2018-10-10 14:54:14,250 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 367 transitions. Word has length 99 [2018-10-10 14:54:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:14,250 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 367 transitions. [2018-10-10 14:54:14,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:54:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 367 transitions. [2018-10-10 14:54:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-10 14:54:14,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:14,253 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:14,254 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:14,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:14,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1410738805, now seen corresponding path program 1 times [2018-10-10 14:54:14,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:14,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:14,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:14,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:14,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:14,692 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:54:14,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:14,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:54:14,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:54:14,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:54:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:14,694 INFO L87 Difference]: Start difference. First operand 346 states and 367 transitions. Second operand 11 states. [2018-10-10 14:54:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:15,875 INFO L93 Difference]: Finished difference Result 379 states and 390 transitions. [2018-10-10 14:54:15,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:54:15,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-10-10 14:54:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:15,880 INFO L225 Difference]: With dead ends: 379 [2018-10-10 14:54:15,880 INFO L226 Difference]: Without dead ends: 379 [2018-10-10 14:54:15,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:54:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-10 14:54:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 345. [2018-10-10 14:54:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-10 14:54:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 366 transitions. [2018-10-10 14:54:15,892 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 366 transitions. Word has length 100 [2018-10-10 14:54:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:15,892 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 366 transitions. [2018-10-10 14:54:15,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:54:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 366 transitions. [2018-10-10 14:54:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 14:54:15,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:15,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:15,901 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:15,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1033758555, now seen corresponding path program 1 times [2018-10-10 14:54:15,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:15,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:15,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:15,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:15,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:16,060 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:54:16,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:16,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:54:16,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:54:16,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:54:16,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:54:16,062 INFO L87 Difference]: Start difference. First operand 345 states and 366 transitions. Second operand 5 states. [2018-10-10 14:54:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:16,562 INFO L93 Difference]: Finished difference Result 388 states and 399 transitions. [2018-10-10 14:54:16,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:54:16,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-10-10 14:54:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:16,565 INFO L225 Difference]: With dead ends: 388 [2018-10-10 14:54:16,565 INFO L226 Difference]: Without dead ends: 388 [2018-10-10 14:54:16,566 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 14:54:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-10 14:54:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 344. [2018-10-10 14:54:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-10 14:54:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 360 transitions. [2018-10-10 14:54:16,574 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 360 transitions. Word has length 115 [2018-10-10 14:54:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:16,575 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 360 transitions. [2018-10-10 14:54:16,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:54:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 360 transitions. [2018-10-10 14:54:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 14:54:16,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:16,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:16,578 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:16,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:16,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1981744293, now seen corresponding path program 1 times [2018-10-10 14:54:16,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:16,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:16,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:16,801 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:54:16,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:16,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:54:16,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 14:54:16,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 14:54:16,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:54:16,804 INFO L87 Difference]: Start difference. First operand 344 states and 360 transitions. Second operand 4 states. [2018-10-10 14:54:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:16,927 INFO L93 Difference]: Finished difference Result 347 states and 363 transitions. [2018-10-10 14:54:16,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 14:54:16,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-10-10 14:54:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:16,932 INFO L225 Difference]: With dead ends: 347 [2018-10-10 14:54:16,932 INFO L226 Difference]: Without dead ends: 347 [2018-10-10 14:54:16,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:54:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-10 14:54:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2018-10-10 14:54:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-10 14:54:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 361 transitions. [2018-10-10 14:54:16,942 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 361 transitions. Word has length 116 [2018-10-10 14:54:16,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:16,943 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 361 transitions. [2018-10-10 14:54:16,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 14:54:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 361 transitions. [2018-10-10 14:54:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 14:54:16,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:16,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:16,947 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:16,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:16,948 INFO L82 PathProgramCache]: Analyzing trace with hash -365858915, now seen corresponding path program 1 times [2018-10-10 14:54:16,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:16,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:16,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:16,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:16,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:17,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:17,286 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:54:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:17,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:17,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:54:17,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-10 14:54:17,834 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-bitfields-3.1_true-valid-memsafety_true-termination.i_7.bpl [2018-10-10 14:54:17,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:54:17,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:54:17,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:17,842 INFO L87 Difference]: Start difference. First operand 345 states and 361 transitions. Second operand 7 states. [2018-10-10 14:54:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:17,917 INFO L93 Difference]: Finished difference Result 350 states and 366 transitions. [2018-10-10 14:54:17,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:54:17,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-10-10 14:54:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:17,924 INFO L225 Difference]: With dead ends: 350 [2018-10-10 14:54:17,925 INFO L226 Difference]: Without dead ends: 350 [2018-10-10 14:54:17,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-10 14:54:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2018-10-10 14:54:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-10 14:54:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 364 transitions. [2018-10-10 14:54:17,952 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 364 transitions. Word has length 119 [2018-10-10 14:54:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:17,953 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 364 transitions. [2018-10-10 14:54:17,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:54:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 364 transitions. [2018-10-10 14:54:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 14:54:17,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:17,964 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:17,965 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:17,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1434419621, now seen corresponding path program 2 times [2018-10-10 14:54:17,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:17,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:17,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:17,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:17,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:18,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:18,155 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:54:18,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:54:18,217 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-10 14:54:18,217 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:54:18,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:18,459 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:54:18,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:18,486 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:54:18,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:54:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-10 14:54:18,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:54:18,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2018-10-10 14:54:18,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:18,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:18,671 INFO L87 Difference]: Start difference. First operand 348 states and 364 transitions. Second operand 12 states. [2018-10-10 14:54:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:19,652 INFO L93 Difference]: Finished difference Result 352 states and 368 transitions. [2018-10-10 14:54:19,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:54:19,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2018-10-10 14:54:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:19,655 INFO L225 Difference]: With dead ends: 352 [2018-10-10 14:54:19,656 INFO L226 Difference]: Without dead ends: 352 [2018-10-10 14:54:19,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:54:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-10 14:54:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2018-10-10 14:54:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-10 14:54:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 366 transitions. [2018-10-10 14:54:19,664 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 366 transitions. Word has length 122 [2018-10-10 14:54:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:19,664 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 366 transitions. [2018-10-10 14:54:19,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 366 transitions. [2018-10-10 14:54:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 14:54:19,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:19,667 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:19,669 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:19,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash 88613348, now seen corresponding path program 1 times [2018-10-10 14:54:19,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:19,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:19,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:19,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:54:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:19,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:19,987 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:54:19,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:20,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:20,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:54:20,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-10-10 14:54:20,264 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-bitfields-3.1_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 14:54:20,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:54:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:54:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:20,266 INFO L87 Difference]: Start difference. First operand 350 states and 366 transitions. Second operand 11 states. [2018-10-10 14:54:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:20,404 INFO L93 Difference]: Finished difference Result 355 states and 371 transitions. [2018-10-10 14:54:20,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:54:20,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 137 [2018-10-10 14:54:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:20,407 INFO L225 Difference]: With dead ends: 355 [2018-10-10 14:54:20,407 INFO L226 Difference]: Without dead ends: 355 [2018-10-10 14:54:20,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-10 14:54:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2018-10-10 14:54:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-10 14:54:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 369 transitions. [2018-10-10 14:54:20,414 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 369 transitions. Word has length 137 [2018-10-10 14:54:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:20,415 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 369 transitions. [2018-10-10 14:54:20,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:54:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 369 transitions. [2018-10-10 14:54:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 14:54:20,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:20,416 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:20,417 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:20,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:20,418 INFO L82 PathProgramCache]: Analyzing trace with hash -515325460, now seen corresponding path program 2 times [2018-10-10 14:54:20,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:20,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:20,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:20,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:20,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:20,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:20,676 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:54:20,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:54:20,733 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-10 14:54:20,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:54:20,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:20,899 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:54:20,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:20,907 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:54:20,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:54:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-10 14:54:21,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:54:21,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-10 14:54:21,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:54:21,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:54:21,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:54:21,112 INFO L87 Difference]: Start difference. First operand 353 states and 369 transitions. Second operand 14 states. [2018-10-10 14:54:22,203 WARN L178 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-10 14:54:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:23,077 INFO L93 Difference]: Finished difference Result 357 states and 372 transitions. [2018-10-10 14:54:23,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:54:23,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 140 [2018-10-10 14:54:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:23,080 INFO L225 Difference]: With dead ends: 357 [2018-10-10 14:54:23,080 INFO L226 Difference]: Without dead ends: 357 [2018-10-10 14:54:23,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:54:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-10 14:54:23,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2018-10-10 14:54:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-10 14:54:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 370 transitions. [2018-10-10 14:54:23,088 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 370 transitions. Word has length 140 [2018-10-10 14:54:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:23,088 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 370 transitions. [2018-10-10 14:54:23,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:54:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 370 transitions. [2018-10-10 14:54:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-10 14:54:23,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:23,090 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:23,091 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:23,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:23,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1432934923, now seen corresponding path program 1 times [2018-10-10 14:54:23,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:23,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:23,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:23,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:54:23,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:23,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:23,325 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:54:23,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:23,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:23,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:54:23,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-10-10 14:54:23,528 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl [2018-10-10 14:54:23,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:54:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:54:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:54:23,530 INFO L87 Difference]: Start difference. First operand 355 states and 370 transitions. Second operand 15 states. [2018-10-10 14:54:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:23,654 INFO L93 Difference]: Finished difference Result 360 states and 375 transitions. [2018-10-10 14:54:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:54:23,655 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2018-10-10 14:54:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:23,657 INFO L225 Difference]: With dead ends: 360 [2018-10-10 14:54:23,657 INFO L226 Difference]: Without dead ends: 360 [2018-10-10 14:54:23,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:54:23,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-10 14:54:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 358. [2018-10-10 14:54:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-10-10 14:54:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 373 transitions. [2018-10-10 14:54:23,663 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 373 transitions. Word has length 150 [2018-10-10 14:54:23,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:23,664 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 373 transitions. [2018-10-10 14:54:23,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:54:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 373 transitions. [2018-10-10 14:54:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-10 14:54:23,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:23,666 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:23,667 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:54:23,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:23,667 INFO L82 PathProgramCache]: Analyzing trace with hash -74919187, now seen corresponding path program 2 times [2018-10-10 14:54:23,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:23,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:23,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:23,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:23,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:23,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:23,938 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:54:23,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:54:24,021 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:54:24,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:54:24,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:24,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:54:24,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-10 14:54:24,227 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:54:24,232 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:54:24,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:54:24 BoogieIcfgContainer [2018-10-10 14:54:24,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:54:24,233 INFO L168 Benchmark]: Toolchain (without parser) took 15887.13 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 879.2 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -228.9 MB). Peak memory consumption was 650.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:54:24,234 INFO L168 Benchmark]: CDTParser took 0.20 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:54:24,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.66 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:54:24,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.28 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:54:24,236 INFO L168 Benchmark]: Boogie Preprocessor took 37.32 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:54:24,237 INFO L168 Benchmark]: RCFGBuilder took 1400.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -747.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:54:24,238 INFO L168 Benchmark]: TraceAbstraction took 14061.19 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.3 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 507.6 MB). Peak memory consumption was 631.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:54:24,242 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.20 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 318.66 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.28 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 37.32 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 1400.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -747.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14061.19 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.3 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 507.6 MB). Peak memory consumption was 631.9 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 12). - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 60). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 37). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 60). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 285 locations, 31 error locations. TIMEOUT Result, 13.9s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2504 SDtfs, 9276 SDslu, 7888 SDs, 0 SdLazy, 2426 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 780 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=11, 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, 11 MinimizatonAttempts, 170 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1961 NumberOfCodeBlocks, 1943 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1945 ConstructedInterpolants, 0 QuantifiedInterpolants, 582351 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1307 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 27/150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...