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-2.1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:54:17,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:54:17,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:54:17,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:54:17,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:54:17,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:54:17,287 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:54:17,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:54:17,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:54:17,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:54:17,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:54:17,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:54:17,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:54:17,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:54:17,304 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:54:17,305 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:54:17,306 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:54:17,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:54:17,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:54:17,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:54:17,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:54:17,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:54:17,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:54:17,330 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:54:17,330 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:54:17,331 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:54:17,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:54:17,333 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:54:17,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:54:17,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:54:17,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:54:17,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:54:17,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:54:17,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:54:17,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:54:17,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:54:17,338 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:17,359 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:54:17,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:54:17,364 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:54:17,364 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:54:17,364 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:54:17,364 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:54:17,364 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:54:17,365 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:54:17,365 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:54:17,365 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:54:17,365 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:54:17,365 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:54:17,366 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:54:17,366 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:54:17,366 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:54:17,366 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:54:17,366 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:54:17,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:54:17,367 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:54:17,367 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:54:17,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:54:17,367 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:54:17,368 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:54:17,369 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:54:17,369 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:54:17,369 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:17,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:54:17,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:54:17,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:54:17,458 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:54:17,459 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:54:17,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2.1_false-valid-free.i [2018-10-10 14:54:17,756 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd145e4a/164a7a69e286426895efb11823d092a8/FLAGcfb313daa [2018-10-10 14:54:17,967 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:54:17,968 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2.1_false-valid-free.i [2018-10-10 14:54:17,975 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd145e4a/164a7a69e286426895efb11823d092a8/FLAGcfb313daa [2018-10-10 14:54:17,991 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd145e4a/164a7a69e286426895efb11823d092a8 [2018-10-10 14:54:18,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:54:18,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:54:18,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:54:18,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:54:18,012 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:54:18,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:54:17" (1/1) ... [2018-10-10 14:54:18,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bbd9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:18, skipping insertion in model container [2018-10-10 14:54:18,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:54:17" (1/1) ... [2018-10-10 14:54:18,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:54:18,050 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:54:18,227 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:54:18,242 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:54:18,266 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:54:18,298 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:54:18,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:18 WrapperNode [2018-10-10 14:54:18,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:54:18,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:54:18,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:54:18,300 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:54:18,312 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:18" (1/1) ... [2018-10-10 14:54:18,325 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:18" (1/1) ... [2018-10-10 14:54:18,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:54:18,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:54:18,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:54:18,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:54:18,372 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:18" (1/1) ... [2018-10-10 14:54:18,373 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:18" (1/1) ... [2018-10-10 14:54:18,378 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:18" (1/1) ... [2018-10-10 14:54:18,379 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:18" (1/1) ... [2018-10-10 14:54:18,389 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:18" (1/1) ... [2018-10-10 14:54:18,394 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:18" (1/1) ... [2018-10-10 14:54:18,398 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:18" (1/1) ... [2018-10-10 14:54:18,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:54:18,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:54:18,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:54:18,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:54:18,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:18" (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:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:54:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:54:19,868 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:54:19,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:54:19 BoogieIcfgContainer [2018-10-10 14:54:19,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:54:19,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:54:19,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:54:19,874 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:54:19,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:54:17" (1/3) ... [2018-10-10 14:54:19,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8662a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:54:19, skipping insertion in model container [2018-10-10 14:54:19,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:18" (2/3) ... [2018-10-10 14:54:19,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8662a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:54:19, skipping insertion in model container [2018-10-10 14:54:19,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:54:19" (3/3) ... [2018-10-10 14:54:19,878 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_false-valid-free.i [2018-10-10 14:54:19,889 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:54:19,899 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-10-10 14:54:19,917 INFO L257 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2018-10-10 14:54:19,947 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:54:19,948 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:54:19,948 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:54:19,948 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:54:19,948 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:54:19,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:54:19,949 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:54:19,949 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:54:19,949 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:54:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2018-10-10 14:54:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-10 14:54:19,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:19,996 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:19,999 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:20,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:20,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1453980307, now seen corresponding path program 1 times [2018-10-10 14:54:20,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:20,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:20,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:20,594 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:20,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:20,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:54:20,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:54:20,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:54:20,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:20,624 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 7 states. [2018-10-10 14:54:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:22,107 INFO L93 Difference]: Finished difference Result 367 states and 374 transitions. [2018-10-10 14:54:22,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:54:22,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-10-10 14:54:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:22,130 INFO L225 Difference]: With dead ends: 367 [2018-10-10 14:54:22,130 INFO L226 Difference]: Without dead ends: 362 [2018-10-10 14:54:22,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-10 14:54:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 285. [2018-10-10 14:54:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-10 14:54:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 289 transitions. [2018-10-10 14:54:22,201 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 289 transitions. Word has length 98 [2018-10-10 14:54:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:22,202 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 289 transitions. [2018-10-10 14:54:22,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:54:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 289 transitions. [2018-10-10 14:54:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:54:22,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:22,210 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:22,211 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:22,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2123716688, now seen corresponding path program 1 times [2018-10-10 14:54:22,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:22,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:22,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:22,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:22,861 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:22,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:22,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:54:22,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:54:22,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:54:22,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:22,865 INFO L87 Difference]: Start difference. First operand 285 states and 289 transitions. Second operand 11 states. [2018-10-10 14:54:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:23,794 INFO L93 Difference]: Finished difference Result 284 states and 288 transitions. [2018-10-10 14:54:23,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:54:23,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-10-10 14:54:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:23,805 INFO L225 Difference]: With dead ends: 284 [2018-10-10 14:54:23,805 INFO L226 Difference]: Without dead ends: 284 [2018-10-10 14:54:23,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:54:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-10 14:54:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2018-10-10 14:54:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-10 14:54:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 288 transitions. [2018-10-10 14:54:23,837 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 288 transitions. Word has length 99 [2018-10-10 14:54:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:23,842 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 288 transitions. [2018-10-10 14:54:23,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:54:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 288 transitions. [2018-10-10 14:54:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 14:54:23,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:23,848 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] [2018-10-10 14:54:23,850 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:23,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1607495414, now seen corresponding path program 1 times [2018-10-10 14:54:23,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:23,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:23,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:23,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:23,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:24,273 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:24,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:24,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:54:24,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:24,276 INFO L87 Difference]: Start difference. First operand 284 states and 288 transitions. Second operand 12 states. [2018-10-10 14:54:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:25,787 INFO L93 Difference]: Finished difference Result 360 states and 367 transitions. [2018-10-10 14:54:25,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:54:25,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-10-10 14:54:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:25,791 INFO L225 Difference]: With dead ends: 360 [2018-10-10 14:54:25,791 INFO L226 Difference]: Without dead ends: 360 [2018-10-10 14:54:25,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:54:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-10 14:54:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 283. [2018-10-10 14:54:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 14:54:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 287 transitions. [2018-10-10 14:54:25,803 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 287 transitions. Word has length 109 [2018-10-10 14:54:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:25,804 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 287 transitions. [2018-10-10 14:54:25,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 287 transitions. [2018-10-10 14:54:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 14:54:25,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:25,807 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,808 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:25,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:25,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1008481692, now seen corresponding path program 1 times [2018-10-10 14:54:25,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:25,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:25,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:26,193 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:26,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:26,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:54:26,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:26,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:26,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:26,196 INFO L87 Difference]: Start difference. First operand 283 states and 287 transitions. Second operand 12 states. [2018-10-10 14:54:27,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:27,430 INFO L93 Difference]: Finished difference Result 359 states and 366 transitions. [2018-10-10 14:54:27,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:54:27,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2018-10-10 14:54:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:27,434 INFO L225 Difference]: With dead ends: 359 [2018-10-10 14:54:27,434 INFO L226 Difference]: Without dead ends: 359 [2018-10-10 14:54:27,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:54:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-10 14:54:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 282. [2018-10-10 14:54:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-10 14:54:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 286 transitions. [2018-10-10 14:54:27,444 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 286 transitions. Word has length 119 [2018-10-10 14:54:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:27,444 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 286 transitions. [2018-10-10 14:54:27,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 286 transitions. [2018-10-10 14:54:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-10 14:54:27,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:27,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:27,449 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:27,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1168331710, now seen corresponding path program 1 times [2018-10-10 14:54:27,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:27,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:27,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:27,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:28,104 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:28,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:28,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:54:28,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:28,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:28,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:28,106 INFO L87 Difference]: Start difference. First operand 282 states and 286 transitions. Second operand 12 states. [2018-10-10 14:54:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:29,156 INFO L93 Difference]: Finished difference Result 358 states and 365 transitions. [2018-10-10 14:54:29,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:54:29,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 129 [2018-10-10 14:54:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:29,159 INFO L225 Difference]: With dead ends: 358 [2018-10-10 14:54:29,159 INFO L226 Difference]: Without dead ends: 358 [2018-10-10 14:54:29,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:54:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-10 14:54:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 281. [2018-10-10 14:54:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-10 14:54:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 285 transitions. [2018-10-10 14:54:29,167 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 285 transitions. Word has length 129 [2018-10-10 14:54:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:29,168 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 285 transitions. [2018-10-10 14:54:29,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 285 transitions. [2018-10-10 14:54:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-10 14:54:29,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:29,170 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:54:29,171 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:29,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:29,172 INFO L82 PathProgramCache]: Analyzing trace with hash 880136936, now seen corresponding path program 1 times [2018-10-10 14:54:29,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:29,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:29,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:29,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:29,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:29,972 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:54:30,132 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:30,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:30,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:54:30,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:30,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:30,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:30,133 INFO L87 Difference]: Start difference. First operand 281 states and 285 transitions. Second operand 12 states. [2018-10-10 14:54:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:31,075 INFO L93 Difference]: Finished difference Result 357 states and 364 transitions. [2018-10-10 14:54:31,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:54:31,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2018-10-10 14:54:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:31,078 INFO L225 Difference]: With dead ends: 357 [2018-10-10 14:54:31,078 INFO L226 Difference]: Without dead ends: 357 [2018-10-10 14:54:31,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:54:31,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-10 14:54:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 280. [2018-10-10 14:54:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-10 14:54:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 284 transitions. [2018-10-10 14:54:31,085 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 284 transitions. Word has length 139 [2018-10-10 14:54:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:31,086 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 284 transitions. [2018-10-10 14:54:31,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 284 transitions. [2018-10-10 14:54:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-10 14:54:31,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:31,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,089 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:31,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 580852973, now seen corresponding path program 1 times [2018-10-10 14:54:31,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:31,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:54:31,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:31,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:54:31,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:54:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:54:31,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:54:31,289 INFO L87 Difference]: Start difference. First operand 280 states and 284 transitions. Second operand 6 states. [2018-10-10 14:54:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:31,814 INFO L93 Difference]: Finished difference Result 351 states and 358 transitions. [2018-10-10 14:54:31,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:54:31,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2018-10-10 14:54:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:31,818 INFO L225 Difference]: With dead ends: 351 [2018-10-10 14:54:31,819 INFO L226 Difference]: Without dead ends: 351 [2018-10-10 14:54:31,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:54:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-10 14:54:31,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 325. [2018-10-10 14:54:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-10 14:54:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 342 transitions. [2018-10-10 14:54:31,827 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 342 transitions. Word has length 147 [2018-10-10 14:54:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:31,827 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 342 transitions. [2018-10-10 14:54:31,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:54:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 342 transitions. [2018-10-10 14:54:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-10 14:54:31,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:31,829 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,830 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:31,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash 826573169, now seen corresponding path program 1 times [2018-10-10 14:54:31,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:31,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:31,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:31,967 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:31,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:31,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:54:31,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:54:31,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:54:31,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:54:31,969 INFO L87 Difference]: Start difference. First operand 325 states and 342 transitions. Second operand 6 states. [2018-10-10 14:54:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:32,241 INFO L93 Difference]: Finished difference Result 350 states and 357 transitions. [2018-10-10 14:54:32,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:54:32,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-10-10 14:54:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:32,244 INFO L225 Difference]: With dead ends: 350 [2018-10-10 14:54:32,245 INFO L226 Difference]: Without dead ends: 350 [2018-10-10 14:54:32,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:32,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-10 14:54:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 324. [2018-10-10 14:54:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-10 14:54:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 341 transitions. [2018-10-10 14:54:32,252 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 341 transitions. Word has length 148 [2018-10-10 14:54:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:32,252 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 341 transitions. [2018-10-10 14:54:32,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:54:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 341 transitions. [2018-10-10 14:54:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 14:54:32,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:32,254 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,258 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:32,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:32,259 INFO L82 PathProgramCache]: Analyzing trace with hash -146035345, now seen corresponding path program 1 times [2018-10-10 14:54:32,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:32,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:32,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:32,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:32,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:32,554 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:32,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:32,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:54:32,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:54:32,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:54:32,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:54:32,556 INFO L87 Difference]: Start difference. First operand 324 states and 341 transitions. Second operand 8 states. [2018-10-10 14:54:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:32,843 INFO L93 Difference]: Finished difference Result 318 states and 331 transitions. [2018-10-10 14:54:32,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:54:32,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 149 [2018-10-10 14:54:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:32,847 INFO L225 Difference]: With dead ends: 318 [2018-10-10 14:54:32,847 INFO L226 Difference]: Without dead ends: 318 [2018-10-10 14:54:32,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:32,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-10 14:54:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-10-10 14:54:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-10 14:54:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 331 transitions. [2018-10-10 14:54:32,854 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 331 transitions. Word has length 149 [2018-10-10 14:54:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:32,854 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 331 transitions. [2018-10-10 14:54:32,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:54:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 331 transitions. [2018-10-10 14:54:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-10 14:54:32,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:32,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,857 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:32,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash -232128205, now seen corresponding path program 1 times [2018-10-10 14:54:32,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:32,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:32,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:32,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:32,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:33,233 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:33,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:33,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:54:33,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:54:33,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:54:33,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:54:33,234 INFO L87 Difference]: Start difference. First operand 318 states and 331 transitions. Second operand 8 states. [2018-10-10 14:54:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:33,648 INFO L93 Difference]: Finished difference Result 317 states and 330 transitions. [2018-10-10 14:54:33,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:54:33,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2018-10-10 14:54:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:33,651 INFO L225 Difference]: With dead ends: 317 [2018-10-10 14:54:33,652 INFO L226 Difference]: Without dead ends: 317 [2018-10-10 14:54:33,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:54:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-10 14:54:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-10-10 14:54:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-10 14:54:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 330 transitions. [2018-10-10 14:54:33,659 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 330 transitions. Word has length 150 [2018-10-10 14:54:33,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:33,660 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 330 transitions. [2018-10-10 14:54:33,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:54:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 330 transitions. [2018-10-10 14:54:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-10 14:54:33,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:33,662 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,663 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:33,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1946794137, now seen corresponding path program 1 times [2018-10-10 14:54:33,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:33,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:33,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:33,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:33,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:33,940 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:33,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:33,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:54:33,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:54:33,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:54:33,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:54:33,945 INFO L87 Difference]: Start difference. First operand 317 states and 330 transitions. Second operand 6 states. [2018-10-10 14:54:34,976 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 14:54:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:35,307 INFO L93 Difference]: Finished difference Result 346 states and 353 transitions. [2018-10-10 14:54:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:54:35,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-10-10 14:54:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:35,311 INFO L225 Difference]: With dead ends: 346 [2018-10-10 14:54:35,311 INFO L226 Difference]: Without dead ends: 346 [2018-10-10 14:54:35,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:54:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-10 14:54:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 316. [2018-10-10 14:54:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-10 14:54:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 326 transitions. [2018-10-10 14:54:35,319 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 326 transitions. Word has length 165 [2018-10-10 14:54:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:35,319 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 326 transitions. [2018-10-10 14:54:35,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:54:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 326 transitions. [2018-10-10 14:54:35,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-10 14:54:35,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:35,321 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,322 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:35,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:35,323 INFO L82 PathProgramCache]: Analyzing trace with hash 221076323, now seen corresponding path program 1 times [2018-10-10 14:54:35,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:35,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:35,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:35,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:35,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:35,539 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:35,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:35,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:54:35,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 14:54:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 14:54:35,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:54:35,541 INFO L87 Difference]: Start difference. First operand 316 states and 326 transitions. Second operand 4 states. [2018-10-10 14:54:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:35,678 INFO L93 Difference]: Finished difference Result 319 states and 329 transitions. [2018-10-10 14:54:35,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 14:54:35,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-10-10 14:54:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:35,682 INFO L225 Difference]: With dead ends: 319 [2018-10-10 14:54:35,683 INFO L226 Difference]: Without dead ends: 319 [2018-10-10 14:54:35,683 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:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-10 14:54:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-10-10 14:54:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-10 14:54:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 327 transitions. [2018-10-10 14:54:35,690 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 327 transitions. Word has length 166 [2018-10-10 14:54:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:35,690 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 327 transitions. [2018-10-10 14:54:35,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 14:54:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 327 transitions. [2018-10-10 14:54:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-10 14:54:35,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:35,692 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,693 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:35,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2010292443, now seen corresponding path program 1 times [2018-10-10 14:54:35,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:35,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:35,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:35,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:35,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:35,795 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:35,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:35,796 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:35,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:35,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:36,098 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:36,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:54:36,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-10 14:54:36,196 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-bitfields-2.1_false-valid-free.i_13.bpl [2018-10-10 14:54:36,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:54:36,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:54:36,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:36,202 INFO L87 Difference]: Start difference. First operand 317 states and 327 transitions. Second operand 7 states. [2018-10-10 14:54:36,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:36,280 INFO L93 Difference]: Finished difference Result 322 states and 332 transitions. [2018-10-10 14:54:36,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:54:36,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2018-10-10 14:54:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:36,283 INFO L225 Difference]: With dead ends: 322 [2018-10-10 14:54:36,283 INFO L226 Difference]: Without dead ends: 322 [2018-10-10 14:54:36,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:54:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-10 14:54:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-10-10 14:54:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-10 14:54:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 330 transitions. [2018-10-10 14:54:36,291 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 330 transitions. Word has length 169 [2018-10-10 14:54:36,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:36,292 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 330 transitions. [2018-10-10 14:54:36,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:54:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 330 transitions. [2018-10-10 14:54:36,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-10 14:54:36,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:36,293 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,294 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:36,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:36,295 INFO L82 PathProgramCache]: Analyzing trace with hash -291387293, now seen corresponding path program 2 times [2018-10-10 14:54:36,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:36,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:36,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:36,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:36,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:36,617 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:36,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:36,618 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:36,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:54:36,687 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-10 14:54:36,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:54:36,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:36,849 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:36,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:36,872 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:36,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:54:37,341 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 14:54:37,374 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:37,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:54:37,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2018-10-10 14:54:37,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:54:37,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:54:37,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:37,396 INFO L87 Difference]: Start difference. First operand 320 states and 330 transitions. Second operand 12 states. [2018-10-10 14:54:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:38,037 INFO L93 Difference]: Finished difference Result 324 states and 334 transitions. [2018-10-10 14:54:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:54:38,038 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-10-10 14:54:38,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:38,040 INFO L225 Difference]: With dead ends: 324 [2018-10-10 14:54:38,040 INFO L226 Difference]: Without dead ends: 324 [2018-10-10 14:54:38,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:54:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-10 14:54:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2018-10-10 14:54:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-10 14:54:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 332 transitions. [2018-10-10 14:54:38,047 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 332 transitions. Word has length 172 [2018-10-10 14:54:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:38,047 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 332 transitions. [2018-10-10 14:54:38,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:54:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 332 transitions. [2018-10-10 14:54:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-10 14:54:38,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:38,049 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,050 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:38,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:38,050 INFO L82 PathProgramCache]: Analyzing trace with hash -738753758, now seen corresponding path program 1 times [2018-10-10 14:54:38,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:38,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:38,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:38,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:54:38,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:38,612 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:38,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:38,613 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:38,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:38,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:39,261 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:39,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:54:39,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-10-10 14:54:39,318 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-bitfields-2.1_false-valid-free.i_15.bpl [2018-10-10 14:54:39,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:54:39,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:54:39,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:54:39,325 INFO L87 Difference]: Start difference. First operand 322 states and 332 transitions. Second operand 11 states. [2018-10-10 14:54:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:39,418 INFO L93 Difference]: Finished difference Result 327 states and 337 transitions. [2018-10-10 14:54:39,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:54:39,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2018-10-10 14:54:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:39,420 INFO L225 Difference]: With dead ends: 327 [2018-10-10 14:54:39,420 INFO L226 Difference]: Without dead ends: 327 [2018-10-10 14:54:39,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-10 14:54:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-10 14:54:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-10 14:54:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 335 transitions. [2018-10-10 14:54:39,426 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 335 transitions. Word has length 187 [2018-10-10 14:54:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:39,426 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 335 transitions. [2018-10-10 14:54:39,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:54:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 335 transitions. [2018-10-10 14:54:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-10 14:54:39,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:39,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,429 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:39,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash 208591018, now seen corresponding path program 2 times [2018-10-10 14:54:39,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:39,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:39,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:39,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:39,759 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:39,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:54:39,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:54:39,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:54:39,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:54:39,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:54:39,760 INFO L87 Difference]: Start difference. First operand 325 states and 335 transitions. Second operand 8 states. [2018-10-10 14:54:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:54:40,017 INFO L93 Difference]: Finished difference Result 324 states and 333 transitions. [2018-10-10 14:54:40,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:54:40,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 190 [2018-10-10 14:54:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:54:40,020 INFO L225 Difference]: With dead ends: 324 [2018-10-10 14:54:40,020 INFO L226 Difference]: Without dead ends: 324 [2018-10-10 14:54:40,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:54:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-10 14:54:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-10-10 14:54:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-10 14:54:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 333 transitions. [2018-10-10 14:54:40,026 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 333 transitions. Word has length 190 [2018-10-10 14:54:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:54:40,027 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 333 transitions. [2018-10-10 14:54:40,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:54:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 333 transitions. [2018-10-10 14:54:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-10 14:54:40,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:54:40,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,030 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:54:40,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:54:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1735409365, now seen corresponding path program 1 times [2018-10-10 14:54:40,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:54:40,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:54:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:40,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:54:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:54:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:40,644 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-10-10 14:54:40,892 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-10-10 14:54:41,125 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-10-10 14:54:41,567 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-10 14:54:41,928 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-10 14:54:42,300 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-10 14:54:43,423 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:43,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:54:43,423 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:43,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:54:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:54:43,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:54:43,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:54:43,670 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 8 treesize of output 7 [2018-10-10 14:54:43,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-10 14:54:43,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-10 14:54:43,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-10 14:54:43,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-10-10 14:54:43,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-10 14:54:43,851 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-10-10 14:54:43,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2018-10-10 14:54:43,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-10 14:54:43,967 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:43,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-10-10 14:54:43,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:43,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2018-10-10 14:54:44,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-10 14:54:44,023 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:44,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-10-10 14:54:44,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:44,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:44,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:44,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2018-10-10 14:54:44,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-10-10 14:54:44,158 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 28 treesize of output 27 [2018-10-10 14:54:44,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:44,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:44,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:54:44,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-10-10 14:54:44,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 47 [2018-10-10 14:54:44,568 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:44,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-10-10 14:54:44,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:44,608 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:44,611 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:44,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 54 [2018-10-10 14:54:44,633 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-10 14:54:44,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:54:44,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:54:44,696 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:50, output treesize:90 [2018-10-10 14:54:44,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 67 [2018-10-10 14:54:44,981 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:44,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:44,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:44,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 85 [2018-10-10 14:54:44,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:45,082 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,093 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,100 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 120 [2018-10-10 14:54:45,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-10 14:54:45,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:54:45,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2018-10-10 14:54:45,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,438 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,441 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,442 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,444 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,445 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:45,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 113 [2018-10-10 14:54:45,490 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-10 14:54:45,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:54:45,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-10 14:54:45,728 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:128, output treesize:277 [2018-10-10 14:54:45,927 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-10 14:54:46,443 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-10-10 14:54:46,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-10-10 14:54:46,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:46,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:46,521 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:46,523 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:46,525 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:46,527 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:46,530 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:46,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:46,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:46,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 118 [2018-10-10 14:54:46,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:54:46,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:54:47,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 59 [2018-10-10 14:54:47,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,101 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,103 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,105 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,107 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,109 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,111 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,113 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,115 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,117 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,120 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,122 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,124 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,136 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,184 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-10-10 14:54:47,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 229 [2018-10-10 14:54:47,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-10 14:54:47,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:54:47,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-10-10 14:54:47,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,934 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,937 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,938 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,940 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,941 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,943 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,944 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,945 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,947 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,948 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:47,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 178 [2018-10-10 14:54:47,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-10 14:54:48,147 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:54:48,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2018-10-10 14:54:48,503 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,526 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,552 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,573 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,576 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,577 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,580 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,582 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,593 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,595 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,595 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,597 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,600 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,603 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:48,628 INFO L303 Elim1Store]: Index analysis took 169 ms [2018-10-10 14:54:48,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 218 [2018-10-10 14:54:48,645 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-10 14:54:48,814 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:54:49,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 77 [2018-10-10 14:54:49,153 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,156 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,158 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,164 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,166 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,169 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,172 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,175 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,178 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 189 [2018-10-10 14:54:49,273 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-10-10 14:54:49,608 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,609 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,610 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,612 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,613 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,615 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:49,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 117 [2018-10-10 14:54:49,627 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-10 14:54:49,754 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-10 14:54:50,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 5 dim-2 vars, End of recursive call: 21 dim-0 vars, and 13 xjuncts. [2018-10-10 14:54:50,113 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 16 variables, input treesize:342, output treesize:748 [2018-10-10 14:54:53,798 WARN L178 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 38 [2018-10-10 14:54:53,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 59 [2018-10-10 14:54:53,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:53,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:53,961 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:53,966 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:53,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:53,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:53,999 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:54,000 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:54,003 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:54,003 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:54,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:54,015 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:54:54,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 51 treesize of output 229 [2018-10-10 14:54:54,154 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-10 14:54:59,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4096 xjuncts. [2018-10-10 15:01:39,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:39,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:39,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:82, output treesize:7 [2018-10-10 15:01:40,028 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 15:01:40,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 15:01:40,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2018-10-10 15:01:40,075 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-bitfields-2.1_false-valid-free.i_17.bpl [2018-10-10 15:01:40,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:01:40,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:01:40,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1986, Unknown=1, NotChecked=0, Total=2162 [2018-10-10 15:01:40,078 INFO L87 Difference]: Start difference. First operand 324 states and 333 transitions. Second operand 47 states. [2018-10-10 15:01:44,171 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2018-10-10 15:01:44,412 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2018-10-10 15:01:44,671 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2018-10-10 15:01:44,912 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 65 [2018-10-10 15:01:45,366 WARN L178 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 70 [2018-10-10 15:01:45,818 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 98 [2018-10-10 15:01:46,522 WARN L178 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 100 [2018-10-10 15:01:46,835 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 102 [2018-10-10 15:01:47,119 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 70 [2018-10-10 15:01:47,402 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 68 [2018-10-10 15:01:47,783 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 62 [2018-10-10 15:01:48,060 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 66 [2018-10-10 15:01:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:01:48,500 INFO L93 Difference]: Finished difference Result 321 states and 326 transitions. [2018-10-10 15:01:48,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:01:48,501 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 197 [2018-10-10 15:01:48,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:01:48,503 INFO L225 Difference]: With dead ends: 321 [2018-10-10 15:01:48,503 INFO L226 Difference]: Without dead ends: 321 [2018-10-10 15:01:48,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 181 SyntacticMatches, 9 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1058, Invalid=4793, Unknown=1, NotChecked=0, Total=5852 [2018-10-10 15:01:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-10 15:01:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-10-10 15:01:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-10 15:01:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 305 transitions. [2018-10-10 15:01:48,510 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 305 transitions. Word has length 197 [2018-10-10 15:01:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:01:48,511 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 305 transitions. [2018-10-10 15:01:48,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:01:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 305 transitions. [2018-10-10 15:01:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-10 15:01:48,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:01:48,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:01:48,513 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 15:01:48,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:01:48,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1410691087, now seen corresponding path program 1 times [2018-10-10 15:01:48,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 15:01:48,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 15:01:48,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 15:01:48,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 15:01:48,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 15:01:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:01:48,893 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 15:01:48,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:01:48,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 15:01:48,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:01:48,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:01:48,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:01:48,894 INFO L87 Difference]: Start difference. First operand 298 states and 305 transitions. Second operand 8 states. [2018-10-10 15:01:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:01:49,151 INFO L93 Difference]: Finished difference Result 297 states and 303 transitions. [2018-10-10 15:01:49,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:01:49,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 202 [2018-10-10 15:01:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:01:49,153 INFO L225 Difference]: With dead ends: 297 [2018-10-10 15:01:49,153 INFO L226 Difference]: Without dead ends: 297 [2018-10-10 15:01:49,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:01:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-10 15:01:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-10-10 15:01:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-10 15:01:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 303 transitions. [2018-10-10 15:01:49,158 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 303 transitions. Word has length 202 [2018-10-10 15:01:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:01:49,158 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 303 transitions. [2018-10-10 15:01:49,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:01:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 303 transitions. [2018-10-10 15:01:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-10 15:01:49,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:01:49,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:01:49,160 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 15:01:49,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:01:49,160 INFO L82 PathProgramCache]: Analyzing trace with hash -685979422, now seen corresponding path program 1 times [2018-10-10 15:01:49,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 15:01:49,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 15:01:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 15:01:49,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 15:01:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 15:01:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:01:49,721 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-10 15:01:49,938 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-10 15:01:50,725 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2018-10-10 15:01:51,642 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 15:01:51,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 15:01:51,643 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 15:01:51,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 15:01:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:01:51,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 15:01:51,750 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 15:01:51,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:51,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:51,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 15:01:51,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:51,937 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:51,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 15:01:51,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:51,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:51,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 15:01:52,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-10 15:01:52,115 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 10 treesize of output 9 [2018-10-10 15:01:52,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-10-10 15:01:52,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-10 15:01:52,354 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:52,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-10 15:01:52,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:17 [2018-10-10 15:01:52,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-10 15:01:52,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:52,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-10 15:01:52,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:17 [2018-10-10 15:01:52,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-10 15:01:52,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:52,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-10 15:01:52,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:52,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:17 [2018-10-10 15:01:53,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-10-10 15:01:53,365 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 16 treesize of output 15 [2018-10-10 15:01:53,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:53,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:53,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 15:01:53,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-10-10 15:01:54,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2018-10-10 15:01:54,036 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:54,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2018-10-10 15:01:54,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:54,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:54,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 15:01:54,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2018-10-10 15:01:54,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 55 [2018-10-10 15:01:54,328 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:54,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:54,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:54,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 62 [2018-10-10 15:01:54,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:54,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:54,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 15:01:54,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:76 [2018-10-10 15:01:54,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2018-10-10 15:01:54,654 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:54,655 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:54,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:54,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:54,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:54,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:54,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 99 [2018-10-10 15:01:54,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:54,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:01:54,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-10 15:01:54,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:92, output treesize:88 [2018-10-10 15:01:55,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2018-10-10 15:01:55,032 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:55,034 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:55,035 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:55,036 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:55,042 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:55,043 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:55,044 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:55,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 97 [2018-10-10 15:01:55,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-10-10 15:01:55,200 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 15:01:55,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-10-10 15:01:55,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:55,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 32 treesize of output 25 [2018-10-10 15:01:55,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:55,208 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:55,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-10-10 15:01:55,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:55,219 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 15:01:55,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-10-10 15:01:55,221 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 15:01:55,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 15:01:55,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 15:01:55,265 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:97, output treesize:15 [2018-10-10 15:01:55,618 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 15:01:55,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 15:01:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 56 [2018-10-10 15:01:55,660 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/test-bitfields-2.1_false-valid-free.i_19.bpl [2018-10-10 15:01:55,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:01:55,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:01:55,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2880, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:01:55,663 INFO L87 Difference]: Start difference. First operand 297 states and 303 transitions. Second operand 56 states. [2018-10-10 15:01:58,718 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2018-10-10 15:01:58,915 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-10-10 15:01:59,249 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-10-10 15:01:59,517 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2018-10-10 15:01:59,794 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 74 [2018-10-10 15:02:00,147 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 79 [2018-10-10 15:02:00,440 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 78 [2018-10-10 15:02:02,751 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2018-10-10 15:02:05,049 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2018-10-10 15:02:05,448 WARN L178 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 96 [2018-10-10 15:02:05,911 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2018-10-10 15:02:06,494 WARN L178 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 114 [2018-10-10 15:02:07,065 WARN L178 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 114 [2018-10-10 15:02:07,878 WARN L178 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 117 [2018-10-10 15:02:08,342 WARN L178 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 102 [2018-10-10 15:02:08,900 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2018-10-10 15:02:09,243 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2018-10-10 15:02:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:02:09,663 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2018-10-10 15:02:09,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:02:09,663 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 209 [2018-10-10 15:02:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:02:09,666 INFO L225 Difference]: With dead ends: 288 [2018-10-10 15:02:09,666 INFO L226 Difference]: Without dead ends: 288 [2018-10-10 15:02:09,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 184 SyntacticMatches, 10 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=1473, Invalid=6535, Unknown=2, NotChecked=0, Total=8010 [2018-10-10 15:02:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-10 15:02:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 271. [2018-10-10 15:02:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-10 15:02:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 275 transitions. [2018-10-10 15:02:09,672 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 275 transitions. Word has length 209 [2018-10-10 15:02:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:02:09,673 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 275 transitions. [2018-10-10 15:02:09,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:02:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 275 transitions. [2018-10-10 15:02:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-10 15:02:09,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:02:09,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:09,675 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 15:02:09,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:02:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1452958920, now seen corresponding path program 1 times [2018-10-10 15:02:09,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 15:02:09,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 15:02:09,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 15:02:09,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 15:02:09,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 15:02:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:02:09,963 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 15:02:09,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:02:09,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 15:02:09,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:02:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:02:09,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:02:09,965 INFO L87 Difference]: Start difference. First operand 271 states and 275 transitions. Second operand 8 states. [2018-10-10 15:02:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:02:10,161 INFO L93 Difference]: Finished difference Result 270 states and 273 transitions. [2018-10-10 15:02:10,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:02:10,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 214 [2018-10-10 15:02:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:02:10,164 INFO L225 Difference]: With dead ends: 270 [2018-10-10 15:02:10,164 INFO L226 Difference]: Without dead ends: 270 [2018-10-10 15:02:10,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:02:10,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-10 15:02:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-10-10 15:02:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-10 15:02:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2018-10-10 15:02:10,169 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 214 [2018-10-10 15:02:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:02:10,169 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2018-10-10 15:02:10,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:02:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2018-10-10 15:02:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-10 15:02:10,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:02:10,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:10,171 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 15:02:10,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:02:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1383859047, now seen corresponding path program 1 times [2018-10-10 15:02:10,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 15:02:10,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 15:02:10,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 15:02:10,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 15:02:10,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 15:02:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:02:11,756 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 15:02:11,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 15:02:11,756 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 15:02:11,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 15:02:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:02:11,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 15:02:11,849 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 15:02:11,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 15:02:11,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 15:02:11,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5