./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/realloc1_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/memsafety-ext3/realloc1_false-valid-deref.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 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:01:59,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:01:59,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:01:59,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:01:59,988 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:01:59,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:01:59,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:01:59,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:01:59,998 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:02:00,007 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:02:00,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:02:00,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:02:00,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:02:00,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:02:00,014 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:02:00,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:02:00,017 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:02:00,021 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:02:00,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:02:00,028 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:02:00,030 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:02:00,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:02:00,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:02:00,040 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:02:00,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:02:00,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:02:00,046 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:02:00,048 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:02:00,050 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:02:00,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:02:00,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:02:00,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:02:00,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:02:00,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:02:00,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:02:00,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:02:00,059 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 23:02:00,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:02:00,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:02:00,080 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:02:00,080 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:02:00,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:02:00,081 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:02:00,081 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:02:00,082 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:02:00,082 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:02:00,082 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:02:00,082 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:02:00,082 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:02:00,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:02:00,083 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 23:02:00,083 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 23:02:00,083 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 23:02:00,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:02:00,083 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:02:00,083 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:02:00,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:02:00,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:02:00,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:02:00,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:02:00,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:02:00,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:02:00,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:02:00,087 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:02:00,088 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:02:00,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.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 -> 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 [2018-11-28 23:02:00,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:02:00,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:02:00,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:02:00,173 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:02:00,173 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:02:00,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/realloc1_false-valid-deref.c [2018-11-28 23:02:00,240 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583877764/221377899c5345ad85259c900a384456/FLAG81bd3db21 [2018-11-28 23:02:00,741 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:02:00,742 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/realloc1_false-valid-deref.c [2018-11-28 23:02:00,748 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583877764/221377899c5345ad85259c900a384456/FLAG81bd3db21 [2018-11-28 23:02:01,236 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583877764/221377899c5345ad85259c900a384456 [2018-11-28 23:02:01,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:02:01,241 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 23:02:01,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:01,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:02:01,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:02:01,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:01" (1/1) ... [2018-11-28 23:02:01,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d422c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01, skipping insertion in model container [2018-11-28 23:02:01,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:02:01" (1/1) ... [2018-11-28 23:02:01,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:02:01,281 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:02:01,515 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:01,541 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:02:01,564 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:02:01,585 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:02:01,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01 WrapperNode [2018-11-28 23:02:01,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:02:01,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:02:01,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:02:01,587 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:02:01,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01" (1/1) ... [2018-11-28 23:02:01,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01" (1/1) ... [2018-11-28 23:02:01,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01" (1/1) ... [2018-11-28 23:02:01,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01" (1/1) ... [2018-11-28 23:02:01,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01" (1/1) ... [2018-11-28 23:02:01,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01" (1/1) ... [2018-11-28 23:02:01,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01" (1/1) ... [2018-11-28 23:02:01,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:02:01,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:02:01,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:02:01,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:02:01,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:02:01,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:02:01,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:02:01,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:02:01,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2018-11-28 23:02:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 23:02:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 23:02:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 23:02:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-28 23:02:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:02:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:02:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2018-11-28 23:02:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:02:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:02:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:02:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:02:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:02:02,300 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:02:02,300 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 23:02:02,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:02 BoogieIcfgContainer [2018-11-28 23:02:02,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:02:02,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:02:02,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:02:02,305 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:02:02,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:02:01" (1/3) ... [2018-11-28 23:02:02,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29986a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:02, skipping insertion in model container [2018-11-28 23:02:02,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:02:01" (2/3) ... [2018-11-28 23:02:02,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29986a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:02:02, skipping insertion in model container [2018-11-28 23:02:02,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:02" (3/3) ... [2018-11-28 23:02:02,308 INFO L112 eAbstractionObserver]: Analyzing ICFG realloc1_false-valid-deref.c [2018-11-28 23:02:02,318 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:02:02,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-28 23:02:02,346 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-28 23:02:02,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:02:02,375 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:02:02,375 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 23:02:02,375 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:02:02,375 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:02:02,375 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:02:02,376 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:02:02,376 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:02:02,377 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:02:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-28 23:02:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:02,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:02,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:02,414 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:02,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:02,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1411581223, now seen corresponding path program 1 times [2018-11-28 23:02:02,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:02,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:02,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:02,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:02,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:02:02,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:02,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:02,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:02,601 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-11-28 23:02:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:02,671 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-28 23:02:02,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:02,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:02,682 INFO L225 Difference]: With dead ends: 37 [2018-11-28 23:02:02,683 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 23:02:02,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 23:02:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-11-28 23:02:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 23:02:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-28 23:02:02,726 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 8 [2018-11-28 23:02:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:02,726 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-28 23:02:02,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-28 23:02:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:02,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:02,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:02,728 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:02,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:02,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1411581277, now seen corresponding path program 1 times [2018-11-28 23:02:02,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:02,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:02,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:02,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:02,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:02,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:02,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:02,785 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 3 states. [2018-11-28 23:02:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:02,884 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-28 23:02:02,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:02,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:02,885 INFO L225 Difference]: With dead ends: 30 [2018-11-28 23:02:02,886 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 23:02:02,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 23:02:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-28 23:02:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:02:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-28 23:02:02,892 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2018-11-28 23:02:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:02,893 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-28 23:02:02,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-28 23:02:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 23:02:02,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:02,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:02,894 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:02,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:02,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1411581278, now seen corresponding path program 1 times [2018-11-28 23:02:02,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:02,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:03,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:03,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:03,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:03,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:03,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:03,014 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 3 states. [2018-11-28 23:02:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:03,141 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-28 23:02:03,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:03,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 23:02:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:03,143 INFO L225 Difference]: With dead ends: 30 [2018-11-28 23:02:03,143 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 23:02:03,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 23:02:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-28 23:02:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:02:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-28 23:02:03,148 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 8 [2018-11-28 23:02:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:03,149 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-28 23:02:03,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-28 23:02:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:02:03,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:03,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:03,150 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:03,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:03,151 INFO L82 PathProgramCache]: Analyzing trace with hash -701279318, now seen corresponding path program 1 times [2018-11-28 23:02:03,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:03,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:03,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:03,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:03,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:02:03,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:02:03,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:02:03,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:02:03,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:02:03,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:03,238 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 3 states. [2018-11-28 23:02:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:03,311 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-28 23:02:03,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:02:03,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 23:02:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:03,313 INFO L225 Difference]: With dead ends: 30 [2018-11-28 23:02:03,313 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 23:02:03,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:02:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 23:02:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-28 23:02:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:02:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-28 23:02:03,319 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 12 [2018-11-28 23:02:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:03,319 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-28 23:02:03,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:02:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-28 23:02:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:02:03,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:03,322 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:03,322 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:03,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash -701279263, now seen corresponding path program 1 times [2018-11-28 23:02:03,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:03,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:03,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:03,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:03,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:03,768 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-28 23:02:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:03,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:03,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:03,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:03,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:03,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:02:03,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:02:03,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:02:03,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 23:02:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:04,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:04,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-11-28 23:02:04,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:04,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:04,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:04,157 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-11-28 23:02:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:04,420 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-28 23:02:04,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:04,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-11-28 23:02:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:04,422 INFO L225 Difference]: With dead ends: 31 [2018-11-28 23:02:04,422 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 23:02:04,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 23:02:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-28 23:02:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:02:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-28 23:02:04,431 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2018-11-28 23:02:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:04,431 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-28 23:02:04,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-28 23:02:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 23:02:04,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:04,432 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:04,433 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:04,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:04,435 INFO L82 PathProgramCache]: Analyzing trace with hash 77281552, now seen corresponding path program 1 times [2018-11-28 23:02:04,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:04,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:04,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:04,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:04,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:04,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:04,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:04,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:04,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:04,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:04,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-28 23:02:04,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 23:02:04,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:02:04,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:04,757 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-11-28 23:02:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:04,810 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-28 23:02:04,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:02:04,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 23:02:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:04,817 INFO L225 Difference]: With dead ends: 35 [2018-11-28 23:02:04,817 INFO L226 Difference]: Without dead ends: 35 [2018-11-28 23:02:04,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:02:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-28 23:02:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-28 23:02:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:02:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-28 23:02:04,822 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2018-11-28 23:02:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:04,823 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-28 23:02:04,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 23:02:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-28 23:02:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 23:02:04,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:04,824 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:04,825 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:04,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:04,825 INFO L82 PathProgramCache]: Analyzing trace with hash 304709587, now seen corresponding path program 2 times [2018-11-28 23:02:04,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:04,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:04,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:04,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:04,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:05,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:05,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:05,038 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:05,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:02:05,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:05,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:05,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:05,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-28 23:02:05,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 23:02:05,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:02:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:05,216 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2018-11-28 23:02:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:05,600 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-28 23:02:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:02:05,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-28 23:02:05,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:05,602 INFO L225 Difference]: With dead ends: 39 [2018-11-28 23:02:05,602 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 23:02:05,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:02:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 23:02:05,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-28 23:02:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 23:02:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-28 23:02:05,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2018-11-28 23:02:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:05,608 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-28 23:02:05,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 23:02:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-28 23:02:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 23:02:05,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:05,609 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:05,610 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:05,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1914655466, now seen corresponding path program 3 times [2018-11-28 23:02:05,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:05,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:05,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:05,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:05,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:05,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:02:05,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-28 23:02:05,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:05,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:06,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:06,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-28 23:02:06,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 23:02:06,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:02:06,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:06,185 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 12 states. [2018-11-28 23:02:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:06,264 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-28 23:02:06,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:02:06,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-28 23:02:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:06,266 INFO L225 Difference]: With dead ends: 43 [2018-11-28 23:02:06,266 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 23:02:06,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:02:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 23:02:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-11-28 23:02:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:02:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-28 23:02:06,272 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 26 [2018-11-28 23:02:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:06,272 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-28 23:02:06,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 23:02:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-28 23:02:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:02:06,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:06,274 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:06,274 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:06,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:06,274 INFO L82 PathProgramCache]: Analyzing trace with hash -739671847, now seen corresponding path program 4 times [2018-11-28 23:02:06,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:06,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:06,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:06,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:06,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:02:06,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:02:06,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:06,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:06,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:06,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-28 23:02:06,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 23:02:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 23:02:06,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:02:06,708 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 14 states. [2018-11-28 23:02:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:06,821 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-28 23:02:06,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:02:06,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-28 23:02:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:06,823 INFO L225 Difference]: With dead ends: 47 [2018-11-28 23:02:06,823 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 23:02:06,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:02:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 23:02:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-28 23:02:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 23:02:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-28 23:02:06,829 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 30 [2018-11-28 23:02:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:06,829 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-28 23:02:06,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 23:02:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-28 23:02:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 23:02:06,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:06,830 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:06,831 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:06,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:06,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2114763548, now seen corresponding path program 5 times [2018-11-28 23:02:06,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:06,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:07,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:07,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:07,054 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:02:07,171 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-28 23:02:07,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:07,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:07,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:07,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-28 23:02:07,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 23:02:07,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 23:02:07,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:02:07,621 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 16 states. [2018-11-28 23:02:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:08,203 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-28 23:02:08,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:02:08,205 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-28 23:02:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:08,206 INFO L225 Difference]: With dead ends: 51 [2018-11-28 23:02:08,207 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 23:02:08,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:02:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 23:02:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-28 23:02:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 23:02:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-28 23:02:08,213 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 34 [2018-11-28 23:02:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:08,213 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-28 23:02:08,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 23:02:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-28 23:02:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 23:02:08,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:08,215 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:08,215 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:08,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:08,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1816978465, now seen corresponding path program 6 times [2018-11-28 23:02:08,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:08,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:08,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:08,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:08,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:08,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:08,425 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:02:08,468 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-28 23:02:08,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:08,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:08,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:08,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-28 23:02:08,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 23:02:08,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 23:02:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-11-28 23:02:08,657 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 18 states. [2018-11-28 23:02:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:08,733 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-28 23:02:08,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:02:08,738 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-11-28 23:02:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:08,739 INFO L225 Difference]: With dead ends: 55 [2018-11-28 23:02:08,739 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 23:02:08,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-11-28 23:02:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 23:02:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-11-28 23:02:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 23:02:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-28 23:02:08,750 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 38 [2018-11-28 23:02:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:08,750 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-28 23:02:08,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 23:02:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-28 23:02:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 23:02:08,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:08,756 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:08,756 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:08,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1176149214, now seen corresponding path program 7 times [2018-11-28 23:02:08,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:08,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:08,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:08,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:09,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:09,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:09,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-28 23:02:09,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 23:02:09,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 23:02:09,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-11-28 23:02:09,548 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 20 states. [2018-11-28 23:02:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:09,673 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-28 23:02:09,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:02:09,674 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-11-28 23:02:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:09,675 INFO L225 Difference]: With dead ends: 59 [2018-11-28 23:02:09,675 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 23:02:09,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-11-28 23:02:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 23:02:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-11-28 23:02:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 23:02:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-28 23:02:09,680 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 42 [2018-11-28 23:02:09,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:09,681 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-28 23:02:09,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 23:02:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-28 23:02:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 23:02:09,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:09,682 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:09,682 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:09,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:09,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1665945829, now seen corresponding path program 8 times [2018-11-28 23:02:09,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:09,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:09,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:02:09,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:02:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:09,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:02:09,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:02:09,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:02:09,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:02:09,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:02:09,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:02:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:02:10,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:02:10,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-28 23:02:10,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 23:02:10,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 23:02:10,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-11-28 23:02:10,192 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 22 states. [2018-11-28 23:02:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:02:10,288 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-28 23:02:10,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:02:10,289 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-11-28 23:02:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:02:10,290 INFO L225 Difference]: With dead ends: 63 [2018-11-28 23:02:10,290 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 23:02:10,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-11-28 23:02:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 23:02:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-11-28 23:02:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 23:02:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-28 23:02:10,296 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 46 [2018-11-28 23:02:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:02:10,296 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-28 23:02:10,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 23:02:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-28 23:02:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 23:02:10,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:02:10,298 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:02:10,298 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr6ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 23:02:10,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:02:10,298 INFO L82 PathProgramCache]: Analyzing trace with hash 3188008, now seen corresponding path program 9 times [2018-11-28 23:02:10,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:02:10,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:02:10,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:02:10,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:02:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:02:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:02:10,388 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 23:02:10,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:02:10 BoogieIcfgContainer [2018-11-28 23:02:10,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:02:10,439 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:02:10,439 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:02:10,439 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:02:10,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:02:02" (3/4) ... [2018-11-28 23:02:10,444 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 23:02:10,530 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:02:10,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:02:10,532 INFO L168 Benchmark]: Toolchain (without parser) took 9291.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 952.7 MB in the beginning and 989.2 MB in the end (delta: -36.5 MB). Peak memory consumption was 150.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:10,533 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:10,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:10,534 INFO L168 Benchmark]: Boogie Preprocessor took 66.19 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:02:10,534 INFO L168 Benchmark]: RCFGBuilder took 647.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:10,535 INFO L168 Benchmark]: TraceAbstraction took 8136.73 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 997.3 MB in the end (delta: 74.6 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:10,537 INFO L168 Benchmark]: Witness Printer took 91.51 ms. Allocated memory is still 1.2 GB. Free memory was 997.3 MB in the beginning and 989.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:02:10,542 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.19 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 647.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8136.73 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 997.3 MB in the end (delta: 74.6 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. * Witness Printer took 91.51 ms. Allocated memory is still 1.2 GB. Free memory was 997.3 MB in the beginning and 989.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=0, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=1, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=2, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=3, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=4, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=5, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=6, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=7, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=8, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, i=9, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] i++ VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L10] COND FALSE !(i < 10) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] free(p) [L16] p[2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 7 error locations. UNSAFE Result, 8.0s OverallTime, 14 OverallIterations, 10 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 294 SDtfs, 264 SDslu, 817 SDs, 0 SdLazy, 479 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 226 SyntacticMatches, 9 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 40 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 622 NumberOfCodeBlocks, 622 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 81056 SizeOfPredicates, 10 NumberOfNonLiveVariables, 907 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 2/1053 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...