./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/freeAlloca.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/freeAlloca.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd24d7b29a77a6b0da9f8cbc1fae4e00216bc104 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:19:06,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:19:06,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:19:06,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:19:06,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:19:06,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:19:06,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:19:06,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:19:06,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:19:06,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:19:06,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:19:06,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:19:06,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:19:06,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:19:06,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:19:06,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:19:06,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:19:06,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:19:06,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:19:06,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:19:06,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:19:06,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:19:06,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:19:06,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:19:06,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:19:06,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:19:06,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:19:06,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:19:06,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:19:06,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:19:06,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:19:06,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:19:06,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:19:06,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:19:06,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:19:06,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:19:06,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:19:06,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:19:06,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:19:06,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:19:06,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:19:06,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:19:06,403 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:19:06,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:19:06,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:19:06,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:19:06,408 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:19:06,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:19:06,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:19:06,409 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:19:06,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:19:06,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:19:06,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:19:06,410 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:19:06,410 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:19:06,410 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:19:06,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:19:06,411 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:19:06,411 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:19:06,411 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:19:06,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:19:06,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:19:06,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:19:06,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:19:06,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:19:06,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:19:06,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:19:06,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:19:06,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:19:06,413 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:19:06,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd24d7b29a77a6b0da9f8cbc1fae4e00216bc104 [2019-11-28 20:19:06,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:19:06,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:19:06,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:19:06,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:19:06,735 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:19:06,736 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2019-11-28 20:19:06,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a38a5f8/8f1d53c7f25e40229054b66e78b1e2d4/FLAG9b3390b69 [2019-11-28 20:19:07,254 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:19:07,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2019-11-28 20:19:07,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a38a5f8/8f1d53c7f25e40229054b66e78b1e2d4/FLAG9b3390b69 [2019-11-28 20:19:07,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a38a5f8/8f1d53c7f25e40229054b66e78b1e2d4 [2019-11-28 20:19:07,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:19:07,609 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:19:07,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:07,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:19:07,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:19:07,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170d6946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07, skipping insertion in model container [2019-11-28 20:19:07,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:19:07,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:19:07,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:07,825 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:19:07,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:07,850 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:19:07,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07 WrapperNode [2019-11-28 20:19:07,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:07,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:19:07,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:19:07,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:19:07,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:19:07,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:19:07,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:19:07,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:19:07,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (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 [2019-11-28 20:19:08,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:19:08,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:19:08,004 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:19:08,004 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:19:08,005 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:19:08,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-28 20:19:08,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:19:08,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:19:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:19:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:19:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:19:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:19:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:19:08,287 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:19:08,288 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 20:19:08,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:08 BoogieIcfgContainer [2019-11-28 20:19:08,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:19:08,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:19:08,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:19:08,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:19:08,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:19:07" (1/3) ... [2019-11-28 20:19:08,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432f0394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:08, skipping insertion in model container [2019-11-28 20:19:08,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (2/3) ... [2019-11-28 20:19:08,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432f0394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:08, skipping insertion in model container [2019-11-28 20:19:08,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:08" (3/3) ... [2019-11-28 20:19:08,302 INFO L109 eAbstractionObserver]: Analyzing ICFG freeAlloca.c [2019-11-28 20:19:08,315 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:19:08,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 20:19:08,353 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 20:19:08,379 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:19:08,379 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:19:08,379 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:19:08,379 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:19:08,379 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:19:08,379 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:19:08,380 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:19:08,380 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:19:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 20:19:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:08,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:08,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:08,406 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:08,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:08,411 INFO L82 PathProgramCache]: Analyzing trace with hash 996996062, now seen corresponding path program 1 times [2019-11-28 20:19:08,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:08,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111313696] [2019-11-28 20:19:08,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:08,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111313696] [2019-11-28 20:19:08,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:08,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:08,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622132734] [2019-11-28 20:19:08,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:19:08,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:08,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:19:08,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:19:08,616 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-11-28 20:19:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:08,750 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-28 20:19:08,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:19:08,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 20:19:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:08,766 INFO L225 Difference]: With dead ends: 28 [2019-11-28 20:19:08,766 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 20:19:08,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:19:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 20:19:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 20:19:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:19:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-28 20:19:08,817 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 8 [2019-11-28 20:19:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:08,819 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-28 20:19:08,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:19:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-11-28 20:19:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:08,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:08,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:08,821 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash 996995752, now seen corresponding path program 1 times [2019-11-28 20:19:08,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:08,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249907397] [2019-11-28 20:19:08,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:08,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249907397] [2019-11-28 20:19:08,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:08,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:19:08,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357851201] [2019-11-28 20:19:08,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:08,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:08,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:08,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:08,942 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 4 states. [2019-11-28 20:19:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,006 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-11-28 20:19:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:09,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,008 INFO L225 Difference]: With dead ends: 31 [2019-11-28 20:19:09,008 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 20:19:09,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 20:19:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-11-28 20:19:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 20:19:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 20:19:09,016 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 8 [2019-11-28 20:19:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:09,016 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 20:19:09,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 20:19:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:09,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:09,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:09,018 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:09,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash 996995806, now seen corresponding path program 1 times [2019-11-28 20:19:09,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:09,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306756245] [2019-11-28 20:19:09,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306756245] [2019-11-28 20:19:09,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:09,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:09,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533111190] [2019-11-28 20:19:09,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:09,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:09,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:09,137 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2019-11-28 20:19:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,231 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 20:19:09,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:09,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:09,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,233 INFO L225 Difference]: With dead ends: 30 [2019-11-28 20:19:09,233 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 20:19:09,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 20:19:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-11-28 20:19:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:19:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-28 20:19:09,243 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2019-11-28 20:19:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:09,245 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-28 20:19:09,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-28 20:19:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:09,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:09,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:09,249 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash 996995805, now seen corresponding path program 1 times [2019-11-28 20:19:09,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:09,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469914321] [2019-11-28 20:19:09,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469914321] [2019-11-28 20:19:09,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:09,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:09,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139859855] [2019-11-28 20:19:09,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:09,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:09,339 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2019-11-28 20:19:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,408 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-11-28 20:19:09,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:09,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,411 INFO L225 Difference]: With dead ends: 25 [2019-11-28 20:19:09,411 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 20:19:09,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 20:19:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-28 20:19:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 20:19:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-28 20:19:09,421 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2019-11-28 20:19:09,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:09,422 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-28 20:19:09,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-28 20:19:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:19:09,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:09,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:09,425 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:09,426 INFO L82 PathProgramCache]: Analyzing trace with hash 63449068, now seen corresponding path program 1 times [2019-11-28 20:19:09,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:09,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763890545] [2019-11-28 20:19:09,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:19:09,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763890545] [2019-11-28 20:19:09,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:09,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:09,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327252442] [2019-11-28 20:19:09,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:09,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:09,534 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 4 states. [2019-11-28 20:19:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,578 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-28 20:19:09,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:09,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 20:19:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,580 INFO L225 Difference]: With dead ends: 22 [2019-11-28 20:19:09,580 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 20:19:09,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 20:19:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-28 20:19:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 20:19:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-11-28 20:19:09,588 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2019-11-28 20:19:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:09,588 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-28 20:19:09,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-11-28 20:19:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:19:09,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:09,590 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:09,590 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash 63449121, now seen corresponding path program 1 times [2019-11-28 20:19:09,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:09,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858425748] [2019-11-28 20:19:09,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858425748] [2019-11-28 20:19:09,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:09,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:19:09,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260022375] [2019-11-28 20:19:09,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:19:09,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:19:09,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:09,727 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2019-11-28 20:19:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,790 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-28 20:19:09,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:19:09,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 20:19:09,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,792 INFO L225 Difference]: With dead ends: 23 [2019-11-28 20:19:09,792 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 20:19:09,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 20:19:09,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-28 20:19:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 20:19:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 20:19:09,796 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2019-11-28 20:19:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:09,797 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 20:19:09,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:19:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-28 20:19:09,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:19:09,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:09,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:09,798 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash 425550780, now seen corresponding path program 1 times [2019-11-28 20:19:09,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:09,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510299713] [2019-11-28 20:19:09,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510299713] [2019-11-28 20:19:09,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395182762] [2019-11-28 20:19:09,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:19:09,902 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:09,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 20:19:09,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925053587] [2019-11-28 20:19:09,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:19:09,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:09,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:19:09,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:19:09,938 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2019-11-28 20:19:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,992 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 20:19:09,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:19:09,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 20:19:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,993 INFO L225 Difference]: With dead ends: 27 [2019-11-28 20:19:09,993 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 20:19:09,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:19:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 20:19:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-11-28 20:19:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 20:19:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-28 20:19:10,001 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2019-11-28 20:19:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:10,002 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-28 20:19:10,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:19:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-28 20:19:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:19:10,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:10,003 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:10,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:10,208 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:10,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:10,209 INFO L82 PathProgramCache]: Analyzing trace with hash 316362009, now seen corresponding path program 2 times [2019-11-28 20:19:10,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:10,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706957018] [2019-11-28 20:19:10,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:10,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706957018] [2019-11-28 20:19:10,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045723970] [2019-11-28 20:19:10,309 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:10,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:19:10,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:10,350 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:19:10,352 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 20:19:10,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:19:10,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-11-28 20:19:10,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703656051] [2019-11-28 20:19:10,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:19:10,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:10,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:19:10,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:10,420 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2019-11-28 20:19:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:10,489 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-28 20:19:10,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:19:10,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 20:19:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:10,491 INFO L225 Difference]: With dead ends: 26 [2019-11-28 20:19:10,492 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 20:19:10,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 20:19:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 20:19:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 20:19:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-11-28 20:19:10,496 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2019-11-28 20:19:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:10,497 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-11-28 20:19:10,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:19:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-11-28 20:19:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:19:10,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:10,499 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:10,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:10,700 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:10,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:10,701 INFO L82 PathProgramCache]: Analyzing trace with hash 316354064, now seen corresponding path program 1 times [2019-11-28 20:19:10,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:10,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619464474] [2019-11-28 20:19:10,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:10,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619464474] [2019-11-28 20:19:10,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484201494] [2019-11-28 20:19:10,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:19:10,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:10,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:10,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 20:19:10,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018218454] [2019-11-28 20:19:10,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:19:10,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:10,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:19:10,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:10,846 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 7 states. [2019-11-28 20:19:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:10,908 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-11-28 20:19:10,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:19:10,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 20:19:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:10,910 INFO L225 Difference]: With dead ends: 31 [2019-11-28 20:19:10,910 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 20:19:10,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 20:19:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-11-28 20:19:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 20:19:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-11-28 20:19:10,920 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-11-28 20:19:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:10,920 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-11-28 20:19:10,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:19:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-11-28 20:19:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:19:10,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:10,925 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:11,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:11,129 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash -564453139, now seen corresponding path program 2 times [2019-11-28 20:19:11,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:11,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543883937] [2019-11-28 20:19:11,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:11,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543883937] [2019-11-28 20:19:11,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062435565] [2019-11-28 20:19:11,229 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:11,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:19:11,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:11,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:19:11,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:11,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:11,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 20:19:11,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148374126] [2019-11-28 20:19:11,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:19:11,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:11,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:19:11,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:19:11,317 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 8 states. [2019-11-28 20:19:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:11,406 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-11-28 20:19:11,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:19:11,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 20:19:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:11,410 INFO L225 Difference]: With dead ends: 35 [2019-11-28 20:19:11,411 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 20:19:11,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:19:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 20:19:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-11-28 20:19:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 20:19:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-11-28 20:19:11,418 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2019-11-28 20:19:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:11,419 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-11-28 20:19:11,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:19:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-11-28 20:19:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:19:11,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:11,425 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:11,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:11,626 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:11,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:11,626 INFO L82 PathProgramCache]: Analyzing trace with hash 817651018, now seen corresponding path program 3 times [2019-11-28 20:19:11,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:11,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493547448] [2019-11-28 20:19:11,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:11,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493547448] [2019-11-28 20:19:11,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455039189] [2019-11-28 20:19:11,722 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:11,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 20:19:11,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:11,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:19:11,773 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:11,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:11,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-28 20:19:11,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806989518] [2019-11-28 20:19:11,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:19:11,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:11,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:19:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:11,804 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 9 states. [2019-11-28 20:19:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:11,869 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-11-28 20:19:11,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:19:11,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-28 20:19:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:11,871 INFO L225 Difference]: With dead ends: 39 [2019-11-28 20:19:11,871 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 20:19:11,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 20:19:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-28 20:19:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 20:19:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-11-28 20:19:11,882 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-11-28 20:19:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:11,883 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-11-28 20:19:11,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:19:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-11-28 20:19:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 20:19:11,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:11,886 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:12,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,090 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:12,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1120001241, now seen corresponding path program 4 times [2019-11-28 20:19:12,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:12,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856802340] [2019-11-28 20:19:12,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:12,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856802340] [2019-11-28 20:19:12,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931766799] [2019-11-28 20:19:12,213 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:19:12,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:12,272 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:19:12,280 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:12,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:12,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-28 20:19:12,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132966422] [2019-11-28 20:19:12,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:19:12,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:19:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:19:12,322 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 10 states. [2019-11-28 20:19:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:12,405 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-11-28 20:19:12,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:19:12,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-28 20:19:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:12,406 INFO L225 Difference]: With dead ends: 43 [2019-11-28 20:19:12,407 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:19:12,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:19:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:19:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-28 20:19:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:19:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-11-28 20:19:12,415 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2019-11-28 20:19:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:12,415 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-11-28 20:19:12,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:19:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-11-28 20:19:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 20:19:12,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:12,419 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:12,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,621 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:12,621 INFO L82 PathProgramCache]: Analyzing trace with hash 92254852, now seen corresponding path program 5 times [2019-11-28 20:19:12,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:12,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121299536] [2019-11-28 20:19:12,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:12,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121299536] [2019-11-28 20:19:12,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213136970] [2019-11-28 20:19:12,729 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,794 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-28 20:19:12,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:12,795 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:19:12,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:12,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:12,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-28 20:19:12,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170422067] [2019-11-28 20:19:12,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:19:12,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:12,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:19:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:12,817 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 11 states. [2019-11-28 20:19:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:12,894 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-11-28 20:19:12,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:19:12,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-28 20:19:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:12,896 INFO L225 Difference]: With dead ends: 47 [2019-11-28 20:19:12,896 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 20:19:12,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 20:19:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-11-28 20:19:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 20:19:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-11-28 20:19:12,900 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2019-11-28 20:19:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:12,901 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-11-28 20:19:12,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:19:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-11-28 20:19:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 20:19:12,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:12,902 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:13,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:13,111 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash 696273761, now seen corresponding path program 6 times [2019-11-28 20:19:13,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:13,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906073825] [2019-11-28 20:19:13,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906073825] [2019-11-28 20:19:13,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720958910] [2019-11-28 20:19:13,221 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:13,282 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-28 20:19:13,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:13,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:19:13,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:13,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-11-28 20:19:13,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321831829] [2019-11-28 20:19:13,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:19:13,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:13,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:19:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:19:13,312 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 12 states. [2019-11-28 20:19:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:13,422 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-11-28 20:19:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:19:13,423 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-11-28 20:19:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:13,424 INFO L225 Difference]: With dead ends: 51 [2019-11-28 20:19:13,424 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 20:19:13,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:19:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 20:19:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-28 20:19:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:19:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-11-28 20:19:13,429 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 39 [2019-11-28 20:19:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:13,430 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-11-28 20:19:13,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:19:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-11-28 20:19:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 20:19:13,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:13,431 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:13,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:13,635 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:13,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:13,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1214304834, now seen corresponding path program 7 times [2019-11-28 20:19:13,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:13,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667181510] [2019-11-28 20:19:13,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667181510] [2019-11-28 20:19:13,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051997489] [2019-11-28 20:19:13,758 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,799 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:19:13,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:13,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-28 20:19:13,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18600496] [2019-11-28 20:19:13,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:19:13,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:13,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:19:13,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:19:13,822 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 13 states. [2019-11-28 20:19:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:13,915 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-11-28 20:19:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:19:13,916 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-11-28 20:19:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:13,917 INFO L225 Difference]: With dead ends: 55 [2019-11-28 20:19:13,917 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:19:13,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:19:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:19:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-11-28 20:19:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:19:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-11-28 20:19:13,921 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2019-11-28 20:19:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:13,921 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-11-28 20:19:13,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:19:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-11-28 20:19:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 20:19:13,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:13,923 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:14,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:14,131 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2090572187, now seen corresponding path program 8 times [2019-11-28 20:19:14,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:14,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075451258] [2019-11-28 20:19:14,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:14,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075451258] [2019-11-28 20:19:14,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656180365] [2019-11-28 20:19:14,250 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:14,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:19:14,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:14,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:19:14,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:14,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:14,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-11-28 20:19:14,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505326652] [2019-11-28 20:19:14,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:19:14,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:19:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:19:14,332 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 14 states. [2019-11-28 20:19:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:14,423 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-11-28 20:19:14,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:19:14,424 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-28 20:19:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:14,425 INFO L225 Difference]: With dead ends: 56 [2019-11-28 20:19:14,425 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:19:14,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:19:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:19:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 20:19:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 20:19:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-11-28 20:19:14,432 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 47 [2019-11-28 20:19:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:14,432 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-11-28 20:19:14,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:19:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-11-28 20:19:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 20:19:14,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:14,434 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:14,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:14,638 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:19:14,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:14,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1402261240, now seen corresponding path program 9 times [2019-11-28 20:19:14,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:14,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720280662] [2019-11-28 20:19:14,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:19:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:19:14,740 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:19:14,740 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:19:14,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:19:14 BoogieIcfgContainer [2019-11-28 20:19:14,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:19:14,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:19:14,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:19:14,802 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:19:14,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:08" (3/4) ... [2019-11-28 20:19:14,806 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:19:14,940 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:19:14,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:19:14,947 INFO L168 Benchmark]: Toolchain (without parser) took 7337.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 951.0 MB in the beginning and 989.3 MB in the end (delta: -38.3 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:14,950 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:14,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.82 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:14,951 INFO L168 Benchmark]: Boogie Preprocessor took 94.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:14,952 INFO L168 Benchmark]: RCFGBuilder took 343.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:14,953 INFO L168 Benchmark]: TraceAbstraction took 6508.73 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 87.5 MB). Peak memory consumption was 157.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:14,953 INFO L168 Benchmark]: Witness Printer took 143.10 ms. Allocated memory is still 1.2 GB. Free memory was 996.6 MB in the beginning and 989.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:14,960 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.82 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 343.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6508.73 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 87.5 MB). Peak memory consumption was 157.2 MB. Max. memory is 11.5 GB. * Witness Printer took 143.10 ms. Allocated memory is still 1.2 GB. Free memory was 996.6 MB in the beginning and 989.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L7] char *p = alloca(10 * sizeof(char)); [L9] int i = 0; VAL [alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=97, alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L9] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L13] EXPR p[2] VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}, p[2]=97] [L13] COND TRUE p[2] == 'a' [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 8 error locations. Result: UNSAFE, OverallTime: 6.3s, OverallIterations: 17, TraceHistogramMax: 10, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 243 SDtfs, 235 SDslu, 783 SDs, 0 SdLazy, 697 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 36 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 703 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 626 ConstructedInterpolants, 1 QuantifiedInterpolants, 53253 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1018 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 9/1065 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...